wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

If 2n+1 is a prime number, show that 12,22,32,....n2 when divided by 2n+1 leave different remainder.

Open in App
Solution

Let r,n be two of the numbers 1,2,3,.....n; r2n2 is divisible by 2n+1. Now 2n+1 is a prime number; Hence either r+s or rs must be divisible by 2n+1; But r and s are each less than n, So that r+s or rs is each less than 2n+1; Hence r2s2 cannot be divisible by 2n+1 that is r2 and s2 cannot leave the same remainder when divided by 2n+1

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