Playing with numbers: Balanced Pandigits
|
07-07-2016, 04:40 PM
(This post was last modified: 07-07-2016 04:43 PM by Joe Horn.)
Post: #1
|
|||
|
|||
Playing with numbers: Balanced Pandigits
I know this is not a Number Theory forum, but I see that many of you have played extensively with pandigital numbers (hereafter referred to as pandigits), so I'm hoping you can help me with a pandigit puzzler.
Let's call "balanced pandigits" the set of pandigits which are exactly 10n digits long AND which have each digit (0 through 9) occur exactly n times. The order of the digits doesn't matter; only the count of each must be the same. E.g. 77412551806806934392 is a balanced pandigit because it contains each digit (0 through 9) exactly twice. (As usual, leading zeros are not allowed). I hypothesized that balanced pandigits which were an exact power of an integer would be rare, so I set about looking for the smallest one. But a brute-force search found NO balanced pandigits at all. I'm using UBASIC to raise x to powers as high as it could go before overflowing (very high!), with x starting at 2 and now it's above 30000. I'm mystified. (Maybe I'll try the HP Prime emulator and see if it's faster than UBASIC.) So my question is: Is it provable that no power of x (where x<1023456789 of course) can yield a balanced pandigit? If not, ARE there any? Thanks in advance! EDIT: OH GOOD GRIEF! Immediately after posting the above, the UBASIC program beeped and output 32043^2 = 1026753849. So... never mind! <blush> <0|ΙΈ|0> -Joe- |
|||
« Next Oldest | Next Newest »
|
Messages In This Thread |
Playing with numbers: Balanced Pandigits - Joe Horn - 07-07-2016 04:40 PM
RE: Playing with numbers: Balanced Pandigits - Claudio L. - 07-09-2016, 10:54 AM
RE: Playing with numbers: Balanced Pandigits - Joe Horn - 07-17-2016, 06:37 AM
RE: Playing with numbers: Balanced Pandigits - Arno K - 07-15-2016, 08:23 AM
|
User(s) browsing this thread: 1 Guest(s)