Replies
Original comment in English -
|
Question out of curiosity: how has this been proven If we can't see a pattern in primes? |
Beta Was this translation helpful? Give feedback.
Original comment in English -
|
This theorem, called Bertrand's Postulate, actually has a "short and elegant" proof. (I guess it's "short and elegant" compared to something like Fermat's Last Theorem which is over 100 pages long) |
Beta Was this translation helpful? Give feedback.
-
|
I won't act as if I understand that. But I accept this as "someone smarter said so and other smarter guys did not find an error". |
Beta Was this translation helpful? Give feedback.
|
|
-
|
When your screen is only wide enough to fit 14 characters: A multi-line one-liner! n=int(input())
print([i for i
in range(n,2*n
) if all(not i
%j==0 for j in
range(2, i))]) |
Beta Was this translation helpful? Give feedback.
|
|
-
|
Pull the repo and try next-prime/next.html … it will tell you the next prime… kinda. Imagine some blinking banners on the page as well… I couldn't be bothered to make them yet. Maybe later. |
Beta Was this translation helpful? Give feedback.
|
|
The content you are editing has changed. Please copy your edits and refresh the page.
Nothing to preview
Original comment in English -
Did you know that between any positive number n and 2n inclusive, there is at least one prime number?
Given a number n, find a prime between n and 2n!
Beta Was this translation helpful? Give feedback.