Prime Factorization of Sums and Differences of Two Like Powers

Ziobro, Rafał

doi:10.1515/forma-2016-0015

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].

References

[1] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.
Search in Google Scholar Back to article
[2] 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. doi:10.1007/978-3-319-20615-8_17.
Open DOI Search in Google Scholar Back to article
[3] 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. doi:10.1007/978-1-4613-0015-1 1.
Open DOI Search in Google Scholar Back to article
[4] Jacek Gancarzewicz. Arytmetyka, 2000. In Polish.
Search in Google Scholar Back to article
[5] Andrzej Kondracki. The Chinese Remainder Theorem. Formalized Mathematics, 6(4): 573-577, 1997.
Search in Google Scholar Back to article
[6] Artur Korniłowicz and Piotr Rudnicki. Fundamental Theorem of Arithmetic. Formalized Mathematics, 12(2):179-186, 2004.
Search in Google Scholar Back to article
[7] Rafał Kwiatek. Factorial and Newton coefficients. Formalized Mathematics, 1(5):887-890, 1990.
Search in Google Scholar Back to article
[8] Rafał Kwiatek and Grzegorz Zwara. The divisibility of integers and integer relatively primes. Formalized Mathematics, 1(5):829-832, 1990.
Search in Google Scholar Back to article
[9] Adam Naumowicz. An example of formalizing recent mathematical results in Mizar. Journal of Applied Logic, 4(4):396-413, 2006. doi:10.1016/j.jal.2005.10.003. Towards Computer Aided Mathematics.
Open DOI Search in Google Scholar Back to article
[10] Akira Nishino and Yasunari Shidama. The Maclaurin expansions. Formalized Mathematics, 13(3):421-425, 2005.
Search in Google Scholar Back to article
[11] Konrad Raczkowski and Andrzej Nedzusiak. Real exponents and logarithms. Formalized Mathematics, 2(2):213-216, 1991.
Search in Google Scholar Back to article
[12] Marco Riccardi. Pocklington’s theorem and Bertrand’s postulate. Formalized Mathematics, 14(2):47-52, 2006. doi:10.2478/v10037-006-0007-y.
Open DOI Search in Google Scholar Back to article
[13] Piotr Rudnicki and Andrzej Trybulec. Abian’s fixed point theorem. Formalized Mathematics, 6(3):335-338, 1997.
Search in Google Scholar Back to article
[14] Rafał Ziobro. Fermat’s Little Theorem via divisibility of Newton’s binomial. Formalized Mathematics, 23(3):215-229, 2015. doi:10.1515/forma-2015-0018.
Open DOI Search in Google Scholar Back to article

Prime Factorization of Sums and Differences of Two Like Powers

Abstract

Paradigm

My account