Skip to content
Philoid
Browse Saved
Back to chapter
Maths
1. Euclids Algorithm and Real Numbers
Home · Class 10 · Maths · Ref. Book · 1. Euclids Algorithm and Real Numbers
Prev
Next
Q40 of 128 Page 25

Prove n4 + 4 is a composite number for n > 1



(as a2–b2 = (a + b)(a–b))


….. eq (1)


Now, n > 1


n – 1 > 0


Also,


Therefore, and are distinct positive integers.


So, we can say that


n–1 > 0




Similarly, n + 1 > 0




Therefore, are also distinct.


Thus, from eq(1) n4 + 4 has two distinct factors and 1 as a factor.


So, n4 + 4 is a composite number for n > 1.


More from this chapter

All 128 →
38

Find the smallest number of six digits divisible by 18, 24 and 30

39

Prove if 3 | (a2 + b2) then 3 |a and 3| b, a N, bN.

41

In a morning walk a man, a woman and a child step off together. Their steps measure 90 cm, 80 cm and 60 cm. What is the minimum distance each should walk to cover the distance in complete steps?

42

Find the number nearest to 24001 and between 24001 and 25000 divisible by 16, 24, 40

Questions · 128
1. Euclids Algorithm and Real Numbers
1 2 3 4 5 6 1 1 1 2 3 4 1 1 1 1 2 2 2 2 3 3 3 4 4 4 4 4 5 6 7 8 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43
Back to chapter
ADVERTISEMENT
About Contact Privacy Terms
Philoid · 2026
  • Home
  • Search
  • Browse
  • Quiz
  • Saved