(Non)Automaticity of number theoretic functions

Details (Non)Automaticity of number theoretic functions (Non)Automaticity of number theoretic functions

2008-10-21

arxiv.org/abs/0810.3709v3

Mathematics

Number Theory

11 pages

Scientific paper

Denote by $\lambda(n)$ Liouville's function concerning the parity of the number of prime divisors of $n$. Using a theorem of Allouche, Mend\`es France, and Peyri\`ere and many classical results from the theory of the distribution of prime numbers, we prove that $\lambda(n)$ is not $k$--automatic for any $k> 2$. This yields that $\sum_{n=1}^\infty \lambda(n) X^n\in\mathbb{F}_p[[X]]$ is transcendental over $\mathbb{F}_p(X)$ for any prime $p>2$. Similar results are proven (or reproven) for many common number--theoretic functions, including $\phi$, $\mu$, $\Omega$, $\omega$, $\rho$, and others.

Affiliated with

Also associated with

No associations

Rating

(Non)Automaticity of number theoretic functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with (Non)Automaticity of number theoretic functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and (Non)Automaticity of number theoretic functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-572389