Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

There are several conjectures in Mathematics that seem to be true but have not been proved. Of course, as computing power increased, folks have expanded their search for counterexamples ever and ever upwards.

Providing a counterexample to a conjecture with a very large number would be interesting, but I cannot think of any non-trivial examples where a really large number has been found to disprove a (non-trivial) conjecture. I've seen plenty of large numbers serving as bounds to some value, but usually this is something known to be bounded (i.e. finite) anyway.

Out of curiosity, what's the largest counterexample you've seen to disprove a conjecture?

share|cite|improve this question

marked as duplicate by Start wearing purple, Ittay Weiss, Emily, Dan Rust, Amzoti Jul 23 '13 at 0:29

This question was marked as an exact duplicate of an existing question.

An interesting link: [The phenomena of eventual counterexamples][1] [1]:… – Next Jul 23 '13 at 0:03
Ah, I figured someone would have asked this! My search-fu on this site is not very good. – Emily Jul 23 '13 at 0:06
up vote 0 down vote accepted

Google about Polya's conjecture. I don't know if it is the largest, though. The smallest number that is a counterexample is $906.150.257$, yet it is quite large.

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.