Inspired by this and this, I tried the same thing with n^5 and couldn't find an x that worked (or it is much much larger). Is there an x such that the sum of the digits of x is greater than the sum of the digits of x^5?
#NumberTheory
#ComputerScience
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
No output in 4 hours!! :(
I crashed my computer doing this ... Nice question by the way
Great question to ask!
Well I tried the same thing with S(n)>S(n^4) and it didn't work either.
Log in to reply
124499 works for the forth power. 1+2+4+4+9+9=29 124499**4=240250031031001002001. 2+4+2+5+3+1+3+1+1+2+1=25
Log in to reply
Oh It seems my computer can't handle such large numbers.
Log in to reply
Log in to reply
Log in to reply
x for which the inequality is satisfied. Probably finite solutions exist only when you consider xk for very very large k.
Probably there exists some largeLog in to reply
x then there are infinitely many such x; just append zeroes at the end.
Clearly if there is one suchLog in to reply
Log in to reply
Log in to reply
Log in to reply