All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Average Of Digits of powers (Posted on 2020-08-20)
Let AOD(i) be the sum of digits of i divided by the number of digits of i, or the Average Of Digits.

N is the smallest integer > 1 such that the AOD(N^k) is the same for k in {1,2,3,4}

M has the same requirements as N, except AOD(M) must be an integer.

L has the same requirements as M, except that L is the smallest such integer with AOD(L) equal to some integer other than AOD(M).

Find:

1. N, AOD(N)

2. M, AOD(M)

3. L, AOD(L)

 No Solution Yet Submitted by Larry Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: Misunderstanding of Part 3 | Comment 4 of 7 |
(In reply to Misunderstanding of Part 3 by Larry)

While I did understand the challenge you posed, I could not find any more significant figures lying around in my attic to use to find "L" (if it exists. ) Cheers
 Posted by Steven Lord on 2020-08-21 09:26:27

 Search: Search body:
Forums (0)