Guessing the Prime Number Theorem and Treacherous Logic (Math Chat)
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Frank Morgan, MAA Online|
|The Prime Number theorem says that the probability P(x) that a large integer x is prime is about 1/log x. At about age 16 Gauss apparently conjectured this estimate after studying tables of primes. Greg Martin suggested to me a heuristic way to approach the same conjecture. Suppose that there is a nice probability function P(x) that a large integer x is prime... Challenge: (P and Q) => R if and only if (P => R) or (Q => R). Is this a logical truth?|
|Levels:||High School (9-12), College|
|Math Topics:||Prime Numbers, Logic/Foundations, Probability|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.