Access the full text.
Sign up today, get DeepDyve free for 14 days.
Sommes de chiffres de multiples d'entier
(1982)
Sur la représentation des multiples d’un entier dans une base, Publications mathématiques d’Orsay 83.04
A. Gelfond (1968)
Sur les nombres qui ont des propriétés additives et multiplicatives donnéesActa Arithmetica, 13
C. Mauduit, Joël Rivat (1995)
Répartition des fonctions q-multiplicatives dans la suite $([n^c])_{n∈ ℕ}$, c > 1Acta Arithmetica, 71
J. Solinas (1989)
On the joint distribution of digital sumsJournal of Number Theory, 33
Abstract Let m, g, q ∈ N with q ≥ 2 and (m, q − 1) = 1. For n ∈ N, denote by sn(n) the sum of digits of n in the q-ary digital expansion. Given a polynomial f with integer coefficients, degree d ≥ 1, and such that f(N) ⊂ N, it is shown that there exists C = C(f, m, q) > 0 such that for any g ∈ Z, and all large N, |{0≤n≤N:sq(f(n))≡g(mod m)}|≥CNmin(1,2/dt). In the special case m = q = 2 and f(n) = n2, the value C = 1/20 is admissible. 2000 Mathematics Subject Classification 11B85 (primary), 11N37, 11N69 (secondary). © London Mathematical Society
Bulletin of the London Mathematical Society – Oxford University Press
Published: Feb 1, 2006
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.