The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1 Next

Displaying 1 – 20 of 214

Showing per page

On a conjecture of Dekking : The sum of digits of even numbers

Iurie Boreico, Daniel El-Baz, Thomas Stoll (2014)

Journal de Théorie des Nombres de Bordeaux

Let q 2 and denote by s q the sum-of-digits function in base q . For j = 0 , 1 , , q - 1 consider # { 0 n < N : s q ( 2 n ) j ( mod q ) } . In 1983, F. M. Dekking conjectured that this quantity is greater than N / q and, respectively, less than N / q for infinitely many N , thereby claiming an absence of a drift (or Newman) phenomenon. In this paper we prove his conjecture.

On a problem of Sidon for polynomials over finite fields

Wentang Kuo, Shuntaro Yamagishi (2016)

Acta Arithmetica

Let ω be a sequence of positive integers. Given a positive integer n, we define rₙ(ω) = |(a,b) ∈ ℕ × ℕ : a,b ∈ ω, a+b = n, 0 < a < b|. S. Sidon conjectured that there exists a sequence ω such that rₙ(ω) > 0 for all n sufficiently large and, for all ϵ > 0, l i m n r ( ω ) / n ϵ = 0 . P. Erdős proved this conjecture by showing the existence of a sequence ω of positive integers such that log n ≪ rₙ(ω) ≪ log n. In this paper, we prove an analogue of this conjecture in q [ T ] , where q is a finite field of q elements....

Currently displaying 1 – 20 of 214

Page 1 Next