Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

(Non)Automaticity of number theoretic functions

Michael Coons — 2010

Journal de Théorie des Nombres de Bordeaux

Denote by λ ( n ) Liouville’s function concerning the parity of the number of prime divisors of n . Using a theorem of Allouche, Mendès France, and Peyrière and many classical results from the theory of the distribution of prime numbers, we prove that λ ( n ) is not k –automatic for any k > 2 . This yields that n = 1 λ ( n ) X n 𝔽 p [ [ X ] ] is transcendental over 𝔽 p ( X ) for any prime p > 2 . Similar results are proven (or reproven) for many common number–theoretic functions, including ϕ , μ , Ω , ω , ρ , and others.

Page 1

Download Results (CSV)