- #1

- 285

- 5

How do computers evaluate the number of primes below a given integer?

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.

- I
- Thread starter matqkks
- Start date

- #1

- 285

- 5

How do computers evaluate the number of primes below a given integer?

Mathematics news on Phys.org

- #2

Mentor

- 14,575

- 8,775

Another way is:

https://primes.utm.edu/howmany.html

- #3

- 18,778

- 22,524

This depends on so many parameters, that it can't be answered, except perhaps by the sieve of Eratosthenes, or simply by ##|\pi(x)-\operatorname{Li}(x)|<\dfrac{\sqrt{x}\ln x}{8\pi}##.matqkks said:How do computers evaluate the number of primes below a given integer?

The literature has many algorithms as well as estimations for ##\pi(x)##. Just search for them.

Share:

- Replies
- 13

- Views
- 369

- Replies
- 9

- Views
- 860

- Replies
- 22

- Views
- 1K

- Replies
- 4

- Views
- 734

- Replies
- 1

- Views
- 937

- Replies
- 24

- Views
- 1K

- Replies
- 1

- Views
- 1K

- Replies
- 26

- Views
- 1K

- Replies
- 12

- Views
- 109

- Replies
- 2

- Views
- 679