# Project Euler/16

Jump to navigation
Jump to search

**Project Euler Problem 16** is a problem related to the powers of 2. The task is to find out the "digit sum" (sum of all digits in decimal expansion) of 2^{1000}.

*This article is a stub, which means that it is not detailed enough and needs to be expanded. Please help us by adding some more information.*

## Implementations

### Aheui

This pattern works on both AheuiChem^{[citation needed]} and Try It Online. It uses the "decimal multiplication calculator" algorithm which theoretically works for an arbitrarily large number multiplied by a non-zero digit. It also contains some weird parts, for example, a path branches into two and then the two branches joins up immediately, or paths that branches immediately back to itself.

밣발발발따따따밣밣발따따뿌터너벌 ㅇㅇㅇㅇㅇㅇㅇ쑥너벌벌머차바싹볼 ㅇㅇㅇㅇㅇㅇㅇ뿌터너벌벌서 ㅇㅇㅇ아더뭉셕차숙머어ㅇ오쎤너더벊벌아셕어 ㅇㅇㅇㅇㅇ희무선빠박따빠발발다라싼샨오더오 ㅇㅇㅇㅇ먀썩뻐ㅇㅇㅇㅇㅇ요

## External resources

- A001370, a related sequence on OEIS. The 1001st term is the solution.
- Problem 16 on Project Euler Official Website (not available)
- Problem 16 on Project Euler Mirror