benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Define a number to be an anti-palindrome if, when written in base 3 as a_(n)a_(n−1)…a₀, then a_(i)+a_(n−i)=2 for any 0≤i≤n. Find the number of anti-palindromes less than 3¹² such t… · Discussion

Discussing Define a number to be an anti-palindrome if, when written in base 3 as a_(n)a_(n−1)…a₀, then a_(i)+a_(n−i)=2 for any 0≤i≤n. Find the number of anti-palindromes less than 3¹² such t… · 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.