A criterion for non-automaticity of sequences.
Schlage-Puchta, Jan-Christoph (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Displaying similar documents to “More on Divisibility Criteria for Selected Primes”
A criterion for non-automaticity of sequences.
Squares in Lucas sequenceshaving an even first parameter
Paulo Ribenboim, Wayne McDaniel (1998)
Colloquium Mathematicae
Similarity:
A note on primes p with
Maohua Le (1991)
Colloquium Mathematicae
Similarity:
On finite pseudorandom binary sequences IV: The Liouville function, II
Julien Cassaigne, Sébastien Ferenczi, Christian Mauduit, Joël Rivat, András Sárközy (2000)
Acta Arithmetica
Similarity:
On systems of composite Lehmer numbers with prime indices
J. Wójcik (1996)
Colloquium Mathematicae
Similarity:
On sot hat represents and and not .
Robertson, John P. (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Lagrange’s Four-Square Theorem
Yasushige Watase (2014)
Formalized Mathematics
Similarity:
This article provides a formalized proof of the so-called “the four-square theorem”, namely any natural number can be expressed by a sum of four squares, which was proved by Lagrange in 1770. An informal proof of the theorem can be found in the number theory literature, e.g. in [14], [1] or [23]. This theorem is item #19 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/.
On so that .
Robertson, John P. (2006)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Generalized perfect numbers.
Bege, Antal, Fogarasi, Kinga (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Lower bounds for the solutions in the second case of Fermat's equation with prime power exponents
Maohua Le (1993)
Colloquium Mathematicae
Similarity: