Timeline for Infinitely many primes
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 6, 2019 at 22:29 | comment | added | ovs | @sintax it outputs the sequence for a given p1 indefinitely, as allowed by the default sequence rules. | |
| Sep 6, 2019 at 20:12 | comment | added | sintax | How does this terminate after n steps? | |
| Sep 5, 2019 at 18:27 | history | edited | ovs | CC BY-SA 4.0 | deleted 27 characters in body |
| Sep 5, 2019 at 15:48 | comment | added | ovs | In Python 3 this would be true as input() always returns strings. In Python 2 input() tries to evaluate the input. I'm using Python 2 in this case because the resulting code is slightly shorter. For real code you should try to use Python 3 as it is the newer and more supported version of Python. | |
| Sep 5, 2019 at 15:37 | comment | added | Anthony | I just started with Python, but do you need int(input()) otherwise i is a str? | |
| Sep 5, 2019 at 12:17 | history | edited | ovs | CC BY-SA 4.0 | added 842 characters in body |
| Sep 5, 2019 at 9:05 | history | answered | ovs | CC BY-SA 4.0 |