Time for Primes Phase II: Experimental Verification of the Prime Number Theorem
CSEF · 2008 Mathematics & Software
Overview
Objectives/Goals The average distance between prime numbers is calculated using a random sampling method. The average distance between the primes up to a positive integer n is numerically showed to be approximately ln(n)-1. Methods/Materials A random sampling method is used both by hand and using the computer program mathematica to calculate the average distance between consecutive prime numbers. Results The average distance between prime numbers is shown to be approximately ln(n). Conclusions/Discussion The data obtained experimentally verifies the prime number theorem.
Summary statement
To experimentally show that the average distance between consecutive primes increases.
Help received
Parents helped assemble display board.
Competition history
- CSEF 2008
Resources
Related projects
CSEF · 2018
Fermat vs. Brute Force: The Making of a Better Primality Test
CSEF · 2013
In Search of Pi
CSEF · 2015
From Sums over Natural Numbers to Sums over Primes
ISEF · 2019
Testing Chebyshev's Bias for Prime Numbers Up to 5*10^15
ISEF · 2016
On the Number of Primes Less than a Given Magnitude
CSEF · 2012
Hit or Miss: The Effect of the Number of Trials on the Experimental Value of Pi in Buffon's Needle (Dropping) Experiment
CSEF · 2013
A Computational Exploration of Quadratic Residues and Their Applications
CSEF · 2002
Simple As Pi?
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: California Science & Engineering Fair public projects