<?xml version="1.0" encoding="UTF-8"?>

<record version="3" id="9590">
 <title>hypothesis</title>
 <name>Hypothesis</name>
 <created>2007-06-13 18:41:26</created>
 <modified>2007-08-23 15:57:35</modified>
 <type>Definition</type>
 <creator id="13766" name="PrimeFan"/>
 <author id="17360" name="knodeltheory"/>
 <author id="13766" name="PrimeFan"/>
 <classification>
	<category scheme="msc" code="00A05"/>
 </classification>
 <preamble>% this is the default PlanetMath preamble.  as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here
</preamble>
 <content>\PMlinkescapeword{support}
\PMlinkescapeword{field}
\PMlinkescapeword{label}

In mathematics, a {\em hypothesis} is an unproven statement which is supported by all the available data and by many weaker results. An unproven mathematical statement is usually called a ``conjecture'', and while experimentation can sometimes produce millions of examples to support a conjecture, usually nothing short of a proof can convince experts in the field. But when a conjecture is supported not only but all the available data but also by numerous weaker results, it is upgraded in label to a hypothesis. The most famous conjecture in mathematics is the Riemann hypothesis, which despite many attempts at a proof, is supported by many related results. The convexity conjecture, on the other hand, is considered ``incompatible'' with the $n$-tuples conjecture  and more results appear to support the latter, thus neither is upgraded to hypothesis.

\begin{thebibliography}{1}
\bibitem{rc} R. Crandall \&amp; C. Pomerance, {\it Prime Numbers: A Computational Perspective}, Springer, NY, 2001: 1.2.4
\end{thebibliography}</content>
</record>
