Timeline for Solving/Reducing equations in $\mathbb{Z}/p\mathbb{Z}$
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:56 | history | edited | CommunityBot | replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/ | |
| Dec 16, 2012 at 21:46 | history | edited | Artes | CC BY-SA 3.0 | added 867 characters in body |
| Dec 16, 2012 at 2:30 | history | edited | Artes | CC BY-SA 3.0 | added more detailed discussion |
| Dec 10, 2012 at 2:25 | comment | added | Artes | @CBenni You might play around e.g. with this : Table[ Reduce[ Mod[2^n - n, 10^4] == 0 && k 10^(4) < n < (k + 1) 10^(5 - 1), n, Integers], {k, 10}], while for Mod[2^n - n, 10^5] there is only n == 48736. | |
| Dec 9, 2012 at 17:54 | comment | added | CBenni | Reduce[ Mod[ 2^n - n, 10^k] == 0 && 10^(k-1) < n < 10^k, n, Integers] gives me the same error for k>=5. But in general, shouldnt this be evaluated almost immediately? | |
| Dec 9, 2012 at 15:57 | vote | accept | CBenni | ||
| Dec 9, 2012 at 15:56 | history | edited | Artes | CC BY-SA 3.0 | added 485 characters in body |
| Dec 9, 2012 at 15:23 | history | answered | Artes | CC BY-SA 3.0 |