### David Radcliffe

Shared publicly -I am investigating the sum of digits of 2^n. I have discovered an elementary proof that s(2^n) > log_4 n for all n. What is the best known lower bound for this sequence?

1

2 comments

Ah. In that case, I have discovered an elementary proof that s(2^n) is bounded.

Add a comment...