#Sum of digits NUMBER THEORY problem
15 messages · Page 1 of 1 (latest)
i was about to tell you the sum of digits if the number is written in binary lol
yo why is there no number theory tag lol
yeah just noticed
maybe just write number theory in your title in capital letters that would grab attention
Sum of digits NUMBER THEORY problem
I would be very suprised if a 'formula' for computing this would exist (or that it is known). I think that generally, in number theory, connecting multiplication (taking 2 to the power 100) and how a number looks (its representation in base 10) are quite hard to connect.
I would just simply code this one out
just check if we could do anything by using mod 10 as it might help you get the digits
I think you need to apply the theorem "n congruent to S(n) mod 9" so your sum is gonna be of form 7+ 9k or something idk
Here S(n) is the sum of digits of n
i just ask AI and he said you cannot get exact number without calculating exactly what 2^100 is. idk AI wrong or maybe your question is wrong idk
I found a way for 2^98 lemme know if y'all wanna continue
Can you explain how?? Please
yeah thats what I was able to do until originally