On a problem of Sierpiński
Yong-Gao Chen (2012)
Acta Arithmetica
Similarity:
Yong-Gao Chen (2012)
Acta Arithmetica
Similarity:
Guerin, E.E., Buschman, R.G. (1976)
Portugaliae mathematica
Similarity:
Müller, Tom (2005)
Journal of Integer Sequences [electronic only]
Similarity:
Nyman, Bertil, Nicely, Thomas R. (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Lagarias, J.C., Rains, E.M., Sloane, N.J.A. (2002)
Experimental Mathematics
Similarity:
Noe, Tony D. (2008)
Journal of Integer Sequences [electronic only]
Similarity:
Rowland, Eric S. (2008)
Journal of Integer Sequences [electronic only]
Similarity:
Florian Luca, Francesco Pappalardi (2007)
Acta Arithmetica
Similarity:
Jiahai Kan (2004)
Acta Arithmetica
Similarity:
Magdalena Jastrzebska, Adam Grabowski (2006)
Formalized Mathematics
Similarity:
We formalized some basic properties of the Möbius function which is defined classically as [...] as e.g., its multiplicativity. To enable smooth reasoning about the sum of this number-theoretic function, we introduced an underlying many-sorted set indexed by the set of natural numbers. Its elements are just values of the Möbius function.The second part of the paper is devoted to the notion of the radical of number, i.e. the product of its all prime factors.The formalization (which is...
Larry Ericksen (2009)
Acta Mathematica Universitatis Ostraviensis
Similarity:
The primality of numbers, or of a number constellation, will be determined from residue solutions in the simultaneous congruence equations for binomial coefficients found in Pascal’s triangle. A prime constellation is a set of integers containing all prime numbers. By analyzing these congruences, we can verify the primality of any number. We present different arrangements of binomial coefficient elements for Pascal’s triangle, such as by the row shift method of Mann and Shanks and especially...