Prove an expression is not a square

Click For Summary
SUMMARY

The expression 1! + 2! + ... + n! is proven not to be a square for n ≥ 4 by analyzing its behavior modulo 10. The factorials from 5! onward are congruent to 0 mod 10 due to the presence of both 2 and 5 as factors. Consequently, the sum of the first four factorials, which equals 33, is congruent to 2 mod 10. Since no square number can end in 2 mod 10, it follows that 1! + 2! + ... + n! cannot be a perfect square for n ≥ 4.

PREREQUISITES
  • Understanding of factorial notation and properties
  • Knowledge of modular arithmetic, specifically mod 10
  • Familiarity with properties of square numbers
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study the properties of factorials and their growth rates
  • Learn more about modular arithmetic and its applications in number theory
  • Explore proofs involving congruences and their implications on number properties
  • Investigate other expressions that are not perfect squares and the methods used to prove them
USEFUL FOR

Mathematics students, particularly those studying number theory, educators looking for proof techniques, and anyone interested in the properties of factorials and modular arithmetic.

hew
Messages
5
Reaction score
0

Homework Statement


prove that 1!+2!+...+n! is not a square if n>=4


Homework Equations





The Attempt at a Solution


in the previous part I had to prove that a sqare cannot end in 2,3,7,8 and did this by working in mod10. Do you use this to prove the question? I have written n as 10q+r where q,r are rational numbers and r=0,1,2,...,9 but I don't know where to go from here.
I would prefer a hint rather than the full solution. Thankyou.
 
Physics news on Phys.org
I think i may have solved it. But do tell me if its wrong.
5!=5*4*3*2*1 and is therefore congruent to 0 mod 10 because of the 5 and 2.
so that means that all of the other factorials greater than 5 will also be congruent 0 mod 10. Therefore the remainder will come from adding 1!+2!+3!+4! which equals 32. as this is congruent 2 mod 10 all expressions for n>4 will also be conguent 2 mod 10...meaning that they cannot be squares as the earlier proof showed that numbers ending with 2 mod 10 cannot be squares.
 
1! + 2! + 3! + 4! = 33 :)
Other than this, the proof looks OK to me.
 

Similar threads

Replies
14
Views
5K
Replies
11
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 12 ·
Replies
12
Views
4K
Replies
1
Views
2K
  • · Replies 20 ·
Replies
20
Views
3K
Replies
7
Views
2K
Replies
15
Views
4K
  • · Replies 8 ·
Replies
8
Views
3K