Abstract
We show that a completely multiplicative automatic function which does not have 0 as a value is almost periodic.
Received: 2010-03-11
Accepted: 2011-01-16
Published Online: 2011-08-22
Published in Print: 2011-December
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Completely Multiplicative Automatic Functions
- The k-Periodic Fibonacci Sequence and an Extended Binet's Formula
- Robin's Theorem, Primes, and a New Elementary Reformulation of the Riemann Hypothesis
- Reducing the Erdős–Moser Equation 1n + 2n + ⋯ + kn = (k + 1)n Modulo k and k2
- On Some Conjectures Concerning Stern's Sequence and Its Twist
- Number of Weighted Subsequence Sums with Weights in {1, –1}
- Binomial Coefficient – Harmonic Sum Identities Associated to Supercongruences
- Euler's Pentagonal Number Theorem Implies the Jacobi Triple Product Identity
- On Directions Determined by Subsets of Vector Spaces over Finite Fields
- A Remark on a Paper of Luca and Walsh
- On the Tennis Ball Problem
- On the Conditioned Binomial Coefficients
- Convolution and Reciprocity Formulas for Bernoulli Polynomials
- Counting Finite Languages by Total Word Length
Keywords for this article
Arithmetic Functions;
Automatic Sequences;
Completely Multiplicative Sequences
Articles in the same Issue
- Completely Multiplicative Automatic Functions
- The k-Periodic Fibonacci Sequence and an Extended Binet's Formula
- Robin's Theorem, Primes, and a New Elementary Reformulation of the Riemann Hypothesis
- Reducing the Erdős–Moser Equation 1n + 2n + ⋯ + kn = (k + 1)n Modulo k and k2
- On Some Conjectures Concerning Stern's Sequence and Its Twist
- Number of Weighted Subsequence Sums with Weights in {1, –1}
- Binomial Coefficient – Harmonic Sum Identities Associated to Supercongruences
- Euler's Pentagonal Number Theorem Implies the Jacobi Triple Product Identity
- On Directions Determined by Subsets of Vector Spaces over Finite Fields
- A Remark on a Paper of Luca and Walsh
- On the Tennis Ball Problem
- On the Conditioned Binomial Coefficients
- Convolution and Reciprocity Formulas for Bernoulli Polynomials
- Counting Finite Languages by Total Word Length