Science Fair Projects

Goldbach's Conjecture: True or False?


The objective: To find out if there is a number that will disprove Goldbachs Conjecture, which states that every even number greater than 2 is the sum of two primes, by writing a computer program to test numbers from 4 x 10 to the 14th power through 4 x 10 to the 15th power.


· Microsoft Qbasic
· Microsoft Visual Basic
· Dell 1.9 GHZ Pentium 4 Computer with 256 MB of RAM
· Floppy Disk
· Elementary Basic: Learning to Program Your Computer in Basic with Sherlock Holmes by Henry Ledgard and Andrew Singer, 1982
1. Learn how to program with help from Elementary Basic and computer scientist
2. Find out what numbers have already been tested to see if they are the sum of two prime numbers
3. Write the program
4. Test, revise, and fix the program
5. Run the program for 29 days


The program took 29 days to search from 4 x 10 to the 14th power through 400000001068266 and the program did not find a number that disproves Goldbachs Conjuncture.


The results did support my hypothesis which stated that there is not a number (in the numbers searched) that will disprove Goldbachs Conjecture. The information gained in this subject expanded our knowledge about mathmatics by using modern technology to test an old theory.

This Mathematical project tries to disprove Goldbach's Conjecture using a computer program.

Science Fair Project done By Deanna Lynn McKinstry


Related Projects : Parallax, Adaptive Interference Rejection in Wireless Networking, Statistical Comparison of Radial and Transect Sampling, Centripetally Accelerating Pi, Software and Hardware Implementation of Rubik's Cube Solving Algorithms, Mathematical Model for the Optimal Arrangement of Cell Phone Towers, Complete Mathematical and Physical Relativistic Soliton Universe, Effect of Quantum Computing on Hash Functions, Radical Obsession, Finding Hidden Sequences In Nature, Do Odds-Makers Make Accurate Predictions, Goldbach's Conjecture: True or False?, Debruijn Sequence Taken to Higher Powers, Symmetries and Transformations of n-Cubes and the Nimber-Simplex Graph, Shape to the Max


<<Back To Topics Page........................................................................................>> Next Topic



Copyright © 2013 through 2015