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.
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Let b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {a n}n=1∞ that for almost all n the sum of digits of a n in base b is at least c b log n, where c b is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.
Currently displaying 1 –
16 of
16