# Prove that 16 divides n4 + 4n2 + 11, if n is an odd integer.

Given here, n is an odd integer for some k Z

where Z is the set of all integers.

Since, we know that every odd integer is of the form 4k + 1 and 4k – 1.

Consider two cases:

Case 1: For n = 4k + 1     )

Therefore, it is divisible by 16.

Case 2: For n = 4k – 1     )

Therefore, it is divisible by 16.

Thus, n4 + 4n2 + 11 is divisible by 16.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Related Videos  Interactive Quiz:Euclid's Division Lemma44 mins  Fundamental Theorem of Arithmetic-238 mins  Fundamental Theorem of Arithmetic- 143 mins  Champ Quiz | Fundamental Principle Of Arithmetic41 mins  NCERT | Imp. Qs. on Rational and Irrational Numbers44 mins  Euclids Division Lemma49 mins  Quiz | Imp Qs on Real Numbers37 mins  Interactive Quiz - HCF and LCM32 mins  Application of Euclids Division Lemma50 mins  Relation Between LCM , HCF and Numbers46 mins
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation view all courses 