Talk:First perfect square in base n with n unique digits: Difference between revisions
Talk:First perfect square in base n with n unique digits (view source)
Revision as of 21:35, 22 May 2019
, 5 years agono edit summary
Thundergnat (talk | contribs) (→Leading zeros ?: Reworded.) |
No edit summary |
||
Line 5:
: Ok, kind of weaselly but fair point. Reworded; First perfect square in base 2 with 2 '''significant''' unique digits. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 01:17, 21 May 2019 (UTC)
==Proof==
The task conjectures that the sum from n=0 to some n of 2n+1 has at least one value of n for every base for which the sum is a number containing all digits in the base. Can you prove this conjecture?--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 21:34, 22 May 2019 (UTC)
| |||