Timeline for modulo of sums of consective powers
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7, 2013 at 12:47 | comment | added | Pan Yan | Notice that 2, 3, and 5 in the example above are primes.So, if $f_k(k)=-1 mod (k+1)$, does k+1 must be a prime? | |
| Mar 7, 2013 at 12:27 | comment | added | Pan Yan | That doesn't seem to have a pattern. Actually I am more interested in the value of $f_k(n)$ modulo $m$, for example, $f_1(1)$=-1 (mod 2), $f_2(2)$=-1 (mod 3), $f_4(4)$=-1 (mod 5). I am wondering whether $f_k(k)$ mod m is related to prime number. | |
| Mar 7, 2013 at 2:36 | history | edited | Robert Israel | CC BY-SA 3.0 |
added 17 characters in body
|
| Mar 6, 2013 at 23:03 | history | edited | Robert Israel | CC BY-SA 3.0 |
edited body; added 58 characters in body
|
| Mar 6, 2013 at 21:57 | comment | added | user9072 | Do you mean for m from 1 to 20? | |
| Mar 6, 2013 at 21:54 | history | edited | Robert Israel | CC BY-SA 3.0 |
added 265 characters in body
|
| Mar 6, 2013 at 18:59 | history | answered | Robert Israel | CC BY-SA 3.0 |