Prime Factorization of Sums and Differences of Two Like Powers

Pole DC	Wartość	Język
dc.contributor.author	Ziobro, Rafał	-
dc.date.accessioned	2017-06-02T11:53:00Z	-
dc.date.available	2017-06-02T11:53:00Z	-
dc.date.issued	2016	-
dc.identifier.citation	Formalized Mathematics, Volume 24, Issue 3, pp. 187-198	pl
dc.identifier.issn	1426-2630	pl
dc.identifier.issn	1898-9934	pl
dc.identifier.uri	http://hdl.handle.net/11320/5553	-
dc.description.abstract	Representation of a non zero integer as a signed product of primes is unique similarly to its representations in various types of positional notations [4], [3]. The study focuses on counting the prime factors of integers in the form of sums or differences of two equal powers (thus being represented by 1 and a series of zeroes in respective digital bases).Although the introduced theorems are not particularly important, they provide a couple of shortcuts useful for integer factorization, which could serve in further development of Mizar projects [2]. This could be regarded as one of the important benefits of proof formalization [9].	-
dc.language.iso	en	-
dc.publisher	De Gruyter Open	-
dc.subject	integers	-
dc.subject	factorization	-
dc.subject	primes	-
dc.title	Prime Factorization of Sums and Differences of Two Like Powers	-
dc.type	Article	-
dc.identifier.doi	10.1515/forma-2016-0015	-
dc.description.Affiliation	Department of Carbohydrate Technology University of Agriculture Krakow, Poland	-
dc.description.references	Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.	-
dc.description.references	Grzegorz Bancerek, Czesław Bylinski, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pak, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261-279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1.	-
dc.description.references	Paul Erdős and János Surányi. Topics in the Theory of Numbers, chapter Divisibility, the Fundamental Theorem of Number Theory, pages 1-37. Springer New York, 2003.	-
dc.description.references	Jacek Gancarzewicz. Arytmetyka, 2000. In Polish.	-
dc.description.references	Andrzej Kondracki. The Chinese Remainder Theorem. Formalized Mathematics, 6(4): 573-577, 1997.	-
dc.description.references	Artur Korniłowicz and Piotr Rudnicki. Fundamental Theorem of Arithmetic. Formalized Mathematics, 12(2):179-186, 2004.	-
dc.description.references	Rafał Kwiatek. Factorial and Newton coefficients. Formalized Mathematics, 1(5):887-890, 1990.	-
dc.description.references	Rafał Kwiatek and Grzegorz Zwara. The divisibility of integers and integer relatively primes. Formalized Mathematics, 1(5):829-832, 1990.	-
dc.description.references	Adam Naumowicz. An example of formalizing recent mathematical results in Mizar. Journal of Applied Logic, 4(4):396-413, 2006.	-
dc.description.references	Akira Nishino and Yasunari Shidama. The Maclaurin expansions. Formalized Mathematics, 13(3):421-425, 2005.	-
dc.description.references	Konrad Raczkowski and Andrzej Nedzusiak. Real exponents and logarithms. Formalized Mathematics, 2(2):213-216, 1991.	-
dc.description.references	Marco Riccardi. Pocklington’s theorem and Bertrand’s postulate. Formalized Mathematics, 14(2):47-52, 2006.	-
dc.description.references	Piotr Rudnicki and Andrzej Trybulec. Abian’s fixed point theorem. Formalized Mathematics, 6(3):335-338, 1997.	-
dc.description.references	Rafał Ziobro. Fermat’s Little Theorem via divisibility of Newton’s binomial. Formalized Mathematics, 23(3):215-229, 2015.	-
Występuje w kolekcji(ach):	Formalized Mathematics, 2016, Volume 24, Issue 3

Pliki w tej pozycji:

Plik	Opis	Rozmiar	Format
forma-2016-0015.pdf		259,83 kB	Adobe PDF	Otwórz

Pokaż uproszczony widok rekordu Zobacz statystyki

Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL