|
|
A230311
|
|
Numbers n such that 1^(k*n) + 2^(k*n) + ... + (k*n)^(k*n) == k (mod k*n) for some k; that is, numbers n such that A031971(k*n) == k (mod k*n) for some k.
(history;
published version)
|
|
|
#26 by Alois P. Heinz at Sun Oct 22 08:15:34 EDT 2017
|
|
|
|
#25 by Jonathan Sondow at Sun Oct 22 08:12:24 EDT 2017
|
|
|
|
#24 by Jonathan Sondow at Sun Oct 22 08:11:57 EDT 2017
|
| COMMENTS
|
Same as quotients Q = m/n of solutions to the congruence 1^m + 2^m + . . . + m^m = == n (mod m) with n|m. For Q > 1, a necessary condition is that Q be a primary pseudoperfect number A054377. The condition is not sufficient since the primary pseudoperfect number 52495396602 is not a member. - Jonathan Sondow, Jul 13 2014
|
| LINKS
|
Jose María Grau, A. M. Oller-Marcen, and J. Sondow, <a href="http://arxiv.org/abs/1309.7941">On the congruence 1^m + 2^m + . . . + m^m = == n (mod m) with n|m</a>, Monatshefte für Mathematik 177 (2015) 421-436, DOI 10.1007/s00605-014-0660-0
|
| STATUS
|
approved
editing
|
|
|
|
#23 by Peter Luschny at Sun Oct 22 07:49:28 EDT 2017
|
|
|
|
#22 by Jonathan Sondow at Sun Oct 22 07:44:05 EDT 2017
|
|
|
|
#21 by Jonathan Sondow at Sun Oct 22 07:43:32 EDT 2017
|
| COMMENTS
|
Least such k is A231409. No other terms for n < 10^110. - _ (see Grau, Oller-Marcen, Sondow (2015) p. 428). - _Jonathan Sondow_, Nov 30 2013
|
| LINKS
|
Jose María Grau, A. M. Oller-Marcen, and J. Sondow, <a href="http://arxiv.org/abs/1309.7941">On the congruence 1^m + 2^m + . . . + m^m = n (mod m) with n|m</a>, Monatshefte für Mathematik 177 (2015) 421-436, DOI 10.1007/s00605-014-0660-0
|
| STATUS
|
approved
editing
|
|
|
|
#20 by Michel Marcus at Sun Jul 13 12:48:05 EDT 2014
|
|
|
|
#19 by Joerg Arndt at Sun Jul 13 12:39:08 EDT 2014
|
|
|
|
#18 by Jonathan Sondow at Sun Jul 13 12:12:55 EDT 2014
|
|
|
Discussion
|
Sun Jul 13
| 12:39
| Joerg Arndt: Thanks!
|
|
|
|
#17 by Jonathan Sondow at Sun Jul 13 12:12:26 EDT 2014
|
| LINKS
|
Jose María Grau, A. M. Oller-Marcen, and J. Sondow, <a href="http://arxiv.org/abs/1309.7941">On the congruence 1^m + 2^m + . . . + m^m = n (mod m) with n|m</a>>, Monatshefte für Mathematik, DOI 10.1007/s00605-014-0660-0
|
|
|
Discussion
|
Sun Jul 13
| 12:12
| Jonathan Sondow: I updated the title of the link.
|
|
|
|