Timeline for Running a loop to check for multiple congruences
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 16, 2019 at 21:28 | answer | added | KennyColnago | timeline score: 2 | |
| Mar 21, 2019 at 14:55 | history | edited | user64494 | CC BY-SA 4.0 | A typo in the title is corrected. |
| Mar 21, 2019 at 4:03 | history | edited | J. M.'s missing motivation | edited tags | |
| Mar 21, 2019 at 2:58 | vote | accept | argamon | ||
| Mar 20, 2019 at 23:26 | answer | added | Somos | timeline score: 2 | |
| Mar 20, 2019 at 23:21 | comment | added | Henrik Schumacher | Well, I don't see any problem here. You already found that you may use Select. The only thing you did wrong is not to use And (&&). The selection function is required to produce either True or False. And, of course, you may use any list you like as first argument of Select. | |
| Mar 20, 2019 at 23:17 | comment | added | argamon | thank you @HenrikSchumacher, I actually do not care if the number is a perfect square rather it must have the form (4^n)-1. I apologize for my ignorance but your help is greatly appreciated | |
| Mar 20, 2019 at 23:15 | comment | added | argamon | also I would really like to be able to check whether (4^n)-1 is congruent 0 mod5 0 mod 13 and 0 mod 17 not for 7n+4 | |
| Mar 20, 2019 at 23:14 | comment | added | Henrik Schumacher | Select[Range[10^5]^2, Divisible[#, 5] && Divisible[#, 13] && Divisible[#, 17] &]? | |
| Mar 20, 2019 at 23:09 | history | asked | argamon | CC BY-SA 4.0 |