Re: NS Doubt | |
|
Hi tgdel678 tg First 32 is not a prime number, so you can't use the method you mentioned. Now 32 = 25 and recall that remainder when any number, N is divided by 2n is same as the remainder obtained by dividing number formed by last n-digits of N by same divisor 2n. |
Re: NS Doubt | |
|
Wonderful Sir, I didn't knew that before.. Thanks a lot.. |
Re: NS Doubt | |
|
Sir, Can it be done using this Euler's method also mentioned above by me ?? If so, how ?? Thank you.. |
Re: NS Doubt | |
|
Hi tgdel678 tg, Please tell the answer for the above question. |
Re: NS Doubt | |
|
Hi tgdel678 tg just a quick way to find out remainder in this case, note that any number repeated 6 six times is always divisible by 3,7,11,13,37. As 259 has 7 and 37 as its prime factors, so by each of them remainder is 1, this is because the number 1 has been repeated 73 times , so the number 1 repeated 72 times will always be divisible by 7 and 37. hence by 259 remainder is 1. Also with 32 remainder will be 7, so R1 + R2 = 8 |
Re: NS Doubt | |
| what is the answer??????? |
Re: NS Doubt | |
| (103^4- 101^4) is the answer. Isnt it obvious by my previous post? |
Re: NS Doubt | |
|
@parvesh : u r ryt ... thanx |