- #1

- 80

- 0

is there any proofs for:

"for any natural (n) there are prime numbers from n to 2n,including" ??

"for any natural (n) there are prime numbers from n to 2n,including" ??

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter limitkiller
- Start date

- #1

- 80

- 0

is there any proofs for:

"for any natural (n) there are prime numbers from n to 2n,including" ??

"for any natural (n) there are prime numbers from n to 2n,including" ??

- #2

Gib Z

Homework Helper

- 3,346

- 5

- #3

- 80

- 0

but i had trouble understanding last part :"This gives us the contradiction:n < 468."

could anyone help me with that

- #4

- 80

- 0

help...no one answered for a long time...

Share: