benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Find, as a function of n, the sum of the digits of 9×99×9999×⋯×(10^(2^(n))−1), where each factor has twice as many digits as the previous one. · Discussion

Discussing Find, as a function of n, the sum of the digits of 9×99×9999×⋯×(10^(2^(n))−1), where each factor has twice as many digits as the previous one. · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.