1*2*3*4+1 = 25. Prove it?

[okunyg]

I came across something from the higher classes of math and I tried to prove it:
What do you call this kind of reasoning. Can it be called a proof? Or is this kind of like a pseudo-proof? I've never seen any proofs actually. Is my reasoning correct or is it too ugly to look at?

[The illustrations are in the figure.png file.]

Prove that adding 1 to the product of four following natural numbers results in a square number.

Example: 1*2*3*4+1 = 25 or 5*6*7*8+1 = 1681

$$b^2 = a_1*a_2*a_3*a_4+1$$
$$b = \sqrt{a_1*a_2*a_3*a_4+1}$$
$$b^2-1 = a_1*a_2*a_3*a_4$$

If ($$a_1*a_2*a_3*a_4$$) was to be a square number without adding the one (+1), we could illustrate the product of multiplication with a geometrical square [Figure

#1]. But since we need to add (+1), it means that the square is incomplete (look at [Figure #2]).

The incomplete square in [Figure #2] is calculated to b^2-1 (look at the previous definitions of (b)). How would we calculate the area like in [Figure #1]? We factorize/break out (sorry, English is not my native tongue and I don't know the English math terminology):$$\frac{b^2-1}{b-1}$$ = (b+1) turns into $$(b+1)(b-1) = b^2-1$$Now we see that it is incomplete (if you look at Fig. #2).
What is taken to make [Figure #2] incomplete? We look at the difference:

$$(b^2)-(b^2-1) = -1$$If we neutralize it with (+1), we get a square number:

$$b^2-1+1 = b^2$$

Besides, we know that adding +1 makes b^2 a square number (look at the third definition of b):

$$b^2-1+1 = b^2$$

ABV

 

[morphism]

By writing b² = a₁a₂a₃a₄ + 1, you're assuming that you get a square, which is what you want to establish. Further, you didn't use the fact that you have 4 consecutive natural numbers anywhere in your proof.

I would start over.

What you want to do is show that the following expression
n*(n+1)*(n+2)*(n+3) + 1
is a perfect square.

Hint: re-write it as [n(n+3)]*[(n+1)(n+2)] + 1, and try to expand the things inside the square brackets. Notice anything interesting?

 

[VietDao29]

I came across something from the higher classes of math and I tried to prove it:
What do you call this kind of reasoning. Can it be called a proof? Or is this kind of like a pseudo-proof? I've never seen any proofs actually. Is my reasoning correct or is it too ugly to look at?

[The illustrations are in the figure.png file.]

Prove that adding 1 to the product of four following natural numbers results in a square number.

Example: 1*2*3*4+1 = 25 or 5*6*7*8+1 = 1681

$$b^2 = a_1*a_2*a_3*a_4+1$$
$$b = \sqrt{a_1*a_2*a_3*a_4+1}$$
$$b^2-1 = a_1*a_2*a_3*a_4$$
...

Besides, we know that adding +1 makes b^2 a square number (look at the third definition of b): (We don't know this, We want to prove it)

$$b^2-1+1 = b^2$$

ABV

We do not know if b² is a square number or not. We need to prove that. What you have done, actually, is to assume that it's a square number, and jump to the final conclusion that you've proven it. (Which may take only 2 lines, but you've made it like a page long.). Well, no, you haven'y proven anything yet.

Since b (in your proof) is a real number, b² can be any number, say:
$$b = \sqrt{5} \Rightarrow b ^ 2 = 5$$, so, now, your b² is obviously not a square number.

Can you get this? :)

If you want to re-prove it, see morphism's comment. The product of 4 consecutive integer is n(n + 1)(n + 2)(n + 3), where n is any natural number. Adding 1 to it, gives: n(n + 1)(n + 2)(n + 3) + 1, now, if you can make it something like (...)², then you are done. :)

 

[sutupidmath]

ok i will just give u some more hints, although those that morphism and VietDao29 gave u are sufficient to finish the job.
after u expand the terms which morphism put into bracktets we get
(n^2 +3n)(n^2 +3n+2)+1, than to make it easier to see what you are looking for we can notice that the first two terms in both brackets are the same, so we can take the substitution t=n^2 +3n
after that we have t(t+2)+1=...
And as VietDao29 suggested try to make it like (...)^2 , which is pretty easy to see now, and that is all you need to prove your claims.

 

[Klaus_Hoffmann]

the question he's asking does not involve wilson theorem ? (or a similar form)

$$(p-1)!+1=0mod(p)$$

 

[matt grime]

No it does not involve Wilson's theorem, primes, factorials, or any modulo arithmetic. It is a simple exercise in algebraic manipulation, it is not deep at all. You will note, "Klaus", that there is not mention of primes anywhere at all.

 

[Kummer]

This reminds me of a math competition problem from Hungary.

"Show that the product of 4 consecutive positive integers is never a perfect square"

The solution is the following,
$$n(n+1)(n+2)(n+3) = [n(n+3)][(n+1)(n+2)]$$
$$[n^2+3n][n^2+3n+2]=[(n^2+3n+1)-1][(n^2+3n+1)+1]$$
$$=(n^2+3n+1)^2- 1$$

So if you add 1, you have (n^2+3n+1)^2 which is a perfect square.

 

[martix]

Nice, I encountered this problem recently. Took me a while but it aint that hard. :)

 

[okunyg]

This is what you (I) get from barely knowing anything of math, I guess. Maybe I should read before coming up with crackpot ideas. :P I understand it now though, so thanks.