|
Search: id:A040004
|
|
|
| A040004 |
|
Minimal solution of a congruence. |
|
+0
1
|
|
| 4, 16, 5, 9, 4, 32, 13, 12, 11, 16, 6, 14, 15, 64, 6, 27, 4, 25, 24, 23, 23, 32, 10, 26, 40, 29, 29, 30, 5, 128
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
a(k) = smallest integer s such that for all n, all primes p and all m>0 the congruence (x_1)^k + ... + (x_s)^k == s (mod p^n) has a solution in which not all x_i are all 0 (mod p).
|
|
REFERENCES
|
G. H. Hardy, Collected Papers. Vols. 1-, Oxford Univ. Press, 1966-; see vol. 1, p. 466.
|
|
CROSSREFS
|
Sequence in context: A010295 A059152 A059156 this_sequence A050080 A110651 A115054
Adjacent sequences: A040001 A040002 A040003 this_sequence A040005 A040006 A040007
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Simon Plouffe (simon.plouffe(AT)gmail.com).
|
|
|
Search completed in 0.002 seconds
|
