A criterion for non-automaticity of sequences.
Schlage-Puchta, Jan-Christoph (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Schlage-Puchta, Jan-Christoph (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Darvasi, Gyula (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Julien Cassaigne, Sébastien Ferenczi, Christian Mauduit, Joël Rivat, András Sárközy (2000)
Acta Arithmetica
Similarity:
Christian Ballot (2007)
Journal de Théorie des Nombres de Bordeaux
Similarity:
Hasse showed the existence and computed the Dirichlet density of the set of primes for which the order of is odd; it is . Here we mimic successfully Hasse’s method to compute the density of monic irreducibles in for which the order of is odd. But on the way, we are also led to a new and elementary proof of these densities. More observations are made, and averages are considered, in particular, an average of the ’s as varies through all rational primes.
J. Wójcik (1996)
Colloquium Mathematicae
Similarity:
Bell, Jason P. (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Adam Naumowicz, Radosław Piliszek (2013)
Formalized Mathematics
Similarity:
This paper is a continuation of [19], where the divisibility criteria for initial prime numbers based on their representation in the decimal system were formalized. In the current paper we consider all primes up to 101 to demonstrate the method presented in [7].
Maohua Le (1991)
Colloquium Mathematicae
Similarity:
Lygeros, Nik, Rozier, Olivier (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Szabó, Sándor (2004)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity: