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

1f n > 1, n4 + 4 is. n E N



(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 →
43

If g. c. d (a, b) = 8, l.c.m.. (a, b) = 64 and a > b then a = ……..

43

If g. c. d (a, b) = 1, then g. c. d (a — b, a b) = ………

43

If g. c. d (a, b) = 18, 1. c. m. (a, b) …….

43

has …. digits after decimal point.

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