wu :: forums (http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi)
riddles >> medium >> digit powers
(Message started by: Christine on Feb 22nd, 2012, 10:24am)

Title: digit powers
Post by Christine on Feb 22nd, 2012, 10:24am
Number expressed as sum of integers raised to the  power of its own digits:

For example,

10 = 9^1 + 9^0
3909511=5^3+5^9+5^0+5^9+5^5+5^1+5^1
4624= 4^4 + 4^6 + 4^2 + 4^4

with 10, the "base" integer is 9, with 3909511 it's 5, and 4624 it's 4.

How to find others?
Is the set of these numbers finite or infinite?
Can other integers 2,3,6,7,8,10... be the bases?



Title: Re: digit powers
Post by towr on Feb 22nd, 2012, 12:49pm
here's some I found with a brute force search:
base, sum
9     10
3     12
37     111
8     1033
32     2112
4     4624
25     31301

I think in general it also holds for 10(2k+1)*9-1 with base [10(2k+1)*9-1]/[(2k+1)*9], but it's late and I'm not going to try and prove it.
If not for that sequence, it holds for 109^k-1 with base [109^k-1]/9k. So at least we can say there's an infinite number of them.



Powered by YaBB 1 Gold - SP 1.4!
Forum software copyright © 2000-2004 Yet another Bulletin Board