加载中…
2005-09-15
A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture
Shalosh B. EkhadVince VatterDoron Zeilberger
文献摘要
We prove, via 30 seconds of Maple computation, that there are 10^n words in the alphabet {3,-2} of length 5n, sum 0, and such that every factor that sums to 0 and that starts with a 3 may not be immediately followed by a -2.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本