Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

This question already has an answer here:

This is a soft question. I'm searching for examples of mathmatical statements (preferably in number theory, but other topics are also fine), that seem to be true, but are actually not. Statements where observing some examples would let you think it is always true, but then there is a well hidden counter-example.

If Riemann's $\zeta$ function had a zero beside the critical line, this would be such an example I'm looking for. Or if Fermat's Last Theorem would be false.

Do you know any such surprising counter-exmaples?

share|improve this question

marked as duplicate by Jack M, This is much healthier., Michael Albanese, Hakim, LTS May 27 at 23:30

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

See the prime generating polynomials: mathworld.wolfram.com/Prime-GeneratingPolynomial.html –  Amzoti May 26 at 12:56
The number of primes $\le x$ of the form $4k+3$ is never greater than the number of primes $\le x$ of the form $4k+1$. Please see Prime Number Races. Counterexamples are actually not rare, but the first one is big. –  André Nicolas May 26 at 13:15
Fermat's Last Theorem is proven true... –  Platonix May 26 at 13:21
There are some nice examples in this thread. –  SpamIAm May 26 at 14:05
All prime numbers are odd :-) –  gnasher729 May 26 at 16:32
show 7 more comments

8 Answers 8

The following spikedmath is cute.


The books "Counterexamples in Topology" by Steen and Seebach as well as "Counterexamples in Analysis" by Gelbaum and Olmstead have some that are surprising when you first see them.

share|improve this answer
add comment

For every $n$ $$\int_0^\infty 2 \cos(x) \prod_{i=0}^n\frac{\sin\frac{x}{2i+1}}{\frac{x}{2i+1}}\,dx=\pi/2$$

Is it true? Well, for every $n$ less than 56, but after...

An example of Borwein integral.

share|improve this answer
add comment

Pierre de Fermat conjectured that all Fermat numbers were prime, and a similar mistaken conjecture can be made for most pseudoprimes (Catalan, Fibonacci, Euler, Wieferich, etc.). Also see Euler's sum of Powers conjecture , and the Polya conjecture.

share|improve this answer
Oh, and Merten's conjecture. –  Platonix May 26 at 13:49
add comment

The largest odd value of $n$ such that regular $n$-gons are constructable by compass and straight edge is $n=1~431~655~765$.

There is one known exception: $n=4~294~967~295$.

All in all, there are currently only $31$ known constructable regular polygons with an odd number of sides. Prior to Gauss, the largest odd-sided constructable regular polygon was just the pentagon. No doubt much of the numerological and mystical lore surrounding the pentagon and pentagram can be traced back to observations by the ancients that this five sided shape represented some fundamental boundary between the world of finite imperfect man on one side, and the perfect and infinite on the other.

share|improve this answer
I'd expect the ancients were smart enough to construct the regular $15$-gon from the triangle and pentagon. –  Daniel Fischer May 26 at 17:51
@DanielFischer You're right. Book IV, Proposition 16, of Elements in fact gives the construction. Now editing. –  David H May 26 at 17:56
Is there something missing in the first paragraphs, like "for all $n\leq N$"? The first sentence seems to say that the largest odd $n$ for which $P_n$ is true is $n=1\,431\,655\,765$. What is the exception? That $P_m$ is true for $m=4\,294\,967\,295$? If so, then what is the point of the first sentence? –  JiK May 27 at 13:43
@JiK Exactly. If the first number was $15$ or something it would make more sense, but the fact that the first number itself is so large makes the point of the first example pointless. All it's saying is that the largest known example of a constructable regular polygon with odd sides is $n = 4294967295$, and the second largest example is $n = 1431655765$.. –  Michael T May 28 at 4:22
add comment

Euler's Sum of Powers Conjecture:

$$a_1^k+\ldots+a_n^k=b^k\qquad\text{with }k>n>1$$

has no solutions in positive integers.

The smallest counterexample is

$$95800^4 + 217519^4 + 414560^4 = 422481^4$$

share|improve this answer
smallest in what sense? –  Bennett Gardiner May 27 at 23:39
@BennettGardiner Smallest in lexicographic order $(k,a_1,a_2,\dots,a_n)$. –  Toscho May 28 at 14:09
add comment

Fermat's ‘little’ theorem states that if $n$ is prime, then $$a^n\equiv a\pmod n\tag{$\ast$}$$ holds for all $a$. The converse, which is false, states that if $(\ast)$ holds for all $a$, then $n$ is prime.

Counterexamples to this converse are uncommon; the smallest is $n=561$.

share|improve this answer
add comment

Lucke numbers of Euler:

For every natural number $n$, the following number is prime: $$n^2-n+41$$

The smallest $n$ for which this conjecture is wrong, is 41 -- naturally.

share|improve this answer
add comment

If $\ n\ $ that $\ ◎(n)=\frac{n+1}{2^x}$ or $\ ◎(n)=\frac{n-1}{2^x}, \ n \in \mathbb{Z^+},\ x \in \mathbb{N}_{\gt 0},\ $then $\ n\ $ is prime.
First counter-example is $\ 92673$.
$◎(n)\ $ is called the cycle length of $n$ , detail see: How to prove these two ways give the same numbers?

share|improve this answer
If change 'then $\ n\ $ is prime' to 'then $\ n\ $ is prime or semiprime' ,then $\ 92673\ $ is the only known counter-example. –  miket May 28 at 1:33
add comment

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