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 Mathematics & Software · Entry J1320

Resources

Related projects

Closest projects by meaning, across every fair and year in the corpus.

Browse more like this

Source: California Science & Engineering Fair public projects

Save projects to your library

Sign in with Google to keep track of projects you find interesting, organized into folders. An account also raises your daily allowance for “Has this been done?”, and lets you create a key for the MCP server with a much higher limit than anonymous use. Browsing stays public.

Continue with Google