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)

 Subject Author Date Average Of Digits of powers Eric Janelle 2020-09-24 02:57:43 re(3): Misunderstanding of Part 3 Charlie 2020-08-23 18:40:22 re(2): Misunderstanding of Part 3 Larry 2020-08-23 15:58:35 re: Misunderstanding of Part 3 Steven Lord 2020-08-21 09:26:27 Misunderstanding of Part 3 Larry 2020-08-21 06:53:13 computer solution Charlie 2020-08-20 21:38:52 part 1 and 2 Steven Lord 2020-08-20 21:06:28

 Search: Search body:
Forums (0)