CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Prove that 5k5 is multiple of 4

Open in App
Solution

Let P(n): 5N5
For n = 1,
p(1): 5-5 = 0 which is divisible by 4.
therefore p(1) is divisible by 4.
Now, suppose p(k) is divisible by 4; k belongs to N.
P(k): 5k5=4xm; m belongs to N. - - - -- - (1)
Now, we have to prove p(k+1) is divisible by 4.
P(k+1): 5k+15
=5k+55
=(4xm+5)55 <from [1]>
= 5{(4x+5)-1}
= 5{4xm+5-1}
= 5{4x m+4}
= 5{4(m+1)}
=4 (5x m+5) which is divisible by 4
p(k) is divisible by 4 which implies p(k+1) is divisible by 4.
Hence, p(n) is divisible by 4, by PMI

flag
Suggest Corrections
thumbs-up
2
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
QUANTITATIVE APTITUDE
Watch in App
Join BYJU'S Learning Program
CrossIcon