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

I'd like to have my proof verified and if possible, to see other solutions that are interesting.

Proof: Suppose $n(n+1)$ is a square. Then we write $$n(n+1) = \prod_{p} p^{c(p)}$$ where $c(p) = a(p) + b(p)$ are such that \begin{align*} n &= \prod_p p^{a(p)} \\ n+1 &= \prod_p p^{b(p)} \end{align*} Now, by our hypothesis, $c(p)$ is even for all primes $p$. As $(n,n+1)=1$ for all $n$, it must be that $a(p)$ and $b(p)$ are even for all primes $p$ and moreover, $a(p) = 0$ whenever $b(p)>0$ and reversely.

This indicates that both $n$ and $n+1$ are squares. This is impossible as there are no consecutive squares in the natural numbers.

share|cite|improve this question
There are $1$-$2$ additional ways of solving this here:… – user26486 Jun 11 '14 at 10:29
up vote 49 down vote accepted

$$ n^2<n(n+1)<(n+1)^2 $$

That's all :)

There are no integer number between $n$ and $n+1$.

share|cite|improve this answer
It was exactly i was writting.... – soumajit das May 9 '14 at 5:59
@soumajit das, nice. – Oleg567 May 9 '14 at 6:01
but i type slow...thats the problem.. – soumajit das May 9 '14 at 6:02
I like this, thank you. Is my proof still correct though? – Pavelshu May 9 '14 at 6:04
@Pavelshu Yes, your proof is correct. – 6005 May 9 '14 at 21:29

This is fine if $n=0$ is not allowed (and if $n=0$ is allowed the claim becomes wrong. As you ask for alternative proofs, what can you see from this inequality: $$ n^2<n^2+n<n^2+2n+1$$

share|cite|improve this answer

It looks like this may be the same proof as the OP, but here's how I'd write it:

Let $n$ and $n+1$ be consecutive natural numbers. Note that they must have disjoint prime factorizations. I.e. if $p|n$, then $p \nmid (n+1)$.

For $n(n+1)$ to be a perfect square, then the power on every prime in its decomposition must be even. However, since $n$ and $n+1$ have disjoint prime decompositions, then this is only possible if the power on every prime in the decomposition of $n$ is even, and similarly for $n+1$. This would imply that both $n$ and $n+1$ are perfect squares, which is impossible since no two consecutive naturals can be perfect squares.

Granted, this proof is a lot more clumsy than Hagen's and Oleg's.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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