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 | |
|
Sir, Can it be done using this Euler's method also mentioned above by me ?? If so, how ?? Thank you.. |