You are on page 1of 4

# Share

0

More

Next Blog»

Create Blog

Life of a CAT aspirant
TUESDAY, JUNE 3, 2008

CoPrimes, Euler's Number and Fermat's theorem
Co-Primes are very important , when it comes to finding remainders. First things first, What is a Co-Prime ? 2 numbers are said to be co-primes/relatively prime if their HCF is 1. That is the 2 numbers have no other common factor apart from the number. Co-Primes by themselves serve no purpose.You need to use them with Fermat's theorem / Chinese Remainder Theorem etc. Fermat's theorem states that Remainder (x ^ ( Euler's Number of N) )/N ) = 1 Here X and N have to Co-Primes. Now , what is Euler's Number? Euler's number of a particular number is the number of co-primes less than the number. The total number of co-primes that a certain number can have is infinite. So we need to determine the number of coprimes less than the number. Euler's number for a prime number P is P-1. As all numbers less than that prime number will coprimes of the prime number. As in 1,2,3,4,5,6 will all be coprimes of 7. For other numbers : Euler's Number of a number X = X(1-1/a)(1-1/b).... Here a and b are the prime factors of the number. We look at the number of the prime numbers that are factors of the given number. We ignore the number of times the prime number occurs. So say the number is 18. 18 has 2 and 3 as factors. So Eulers No of 18 = 18(1-1/2)(1-1/3) =6 So if we get a sum like , Find the remainder when (11 ^ 97 )/7 1)See if 11 and 7 are relatively prime to each other 2)If they are relatively prime, Find the Euler's number of the denominator. 3)Express power in terms of the euler's number. For eg, in this case the Euler's number for 7 is 6. So 97 = 6k+1. We know that if we can factorize the numerator in a division, the end remainder will be the product of the remainders of each individual factor. So this becomes (11 ^ 6)/7.....(16 times)* (11 ^ 1)/7 Now as per Fermat's theorem, (11 ^ 6) /7 is 1. So the answer is the remainder when (11^1) is divided by 7. This can be used when the numerator can be factorized. This can be used when the numerator and the denominator are coprimes/relatively prime. Now The question arises what is they are not coprimes. If 2 numbers are not co-primes,it means they have a common factor. See if you can remove the common factor from both the numerator and denominator. In case that can't be done , we will have to use other methods to find the remainder.
Posted by How ard Roark at 7:59 AM

Euler's Formula (Complex)
extension of Euler's Formula through Polar Co-ordinates
www2.plala.or.jp/albatros/

Maths In A Fun Way?
CBSE / ICSE for class 7, 8, 9 & 10 All subjects available at UBQOOL
www.ubqool.com

Maths, English and EVS Worksheets. Free Shipping. Pay Cash on Delivery
www.acadzone .com /C lass…

Algebra Class 6th - 10th
Learn with animated videos & tests Study from Home. Register free
Le arnNe x t.com /Fre e Trial

Cat Oil & Gas Engines
Wide range of engines and modules Expert service and support
www.catoilandgasinfo.com

About Me Howard Roark View my complete profile Blog Archive ▼ 2008 (15) ▼ June (11) TIME AIMCAT 0918 Progressions Speed Maths 3 Is High reading speed necessary to do well in the... TIME AIMCAT 0919 Last 2 digits of an Expression Speed Maths 2 Speed Maths 1 CoPrimes, Euler's Number and Fermat's theorem

Euler's... =11/11(11^96/7) =11/11[(11^(6*16)]/7) (because we know that the Euler no for 7 is 6) but the remainder of [11^(16*6)] /7 is 1 ie 11^96=7k+1 =11/11[{(7k)+1}/7] where k is some constant =11/77 viz 11 August 13. Euler's Number and Fermat's theorem Labels: Coprimes. Remainders Tests for Divisibility Power cycles 3 comments: anwesha said... can you tell me how you would find the remainder of(11^97)/77 January 7.html 2/4 . Fermat's.. Thanks a ton!!! I cant tell u how helpful this was!!! I had been searchign for this from the past few days.blogspot. 2011 11:09 PM Unknown said.. U really explained soo soo well! Thank you again! and God bless you :) August 31.in/2008/06/coprimes-eulers-number-and-fermats. Numbers. 2011 11:33 AM Post a Comment ► May (4) FEEDJIT Live Traffic Feed Newer Post Home Older Post Subscribe to: Post Comments (Atom) onw ardtoiim. and ididnt understand it anywhere else.. 2009 1:27 PM Prasanth Guru said..of a 10/31/12 CAT aspirant: CoPrimes.

Euler's Number and Fermat's theorem" 12 hours 16 mins ago A visitor from Hyderabad. Euler's Number and Fermat's theorem" 3 hours 57 mins ago A visitor from Delhi viewed "Life of a CAT aspirant: Byju CAT Classes" 5 hours 20 mins ago A visitor from Anantapur.blogspot. Euler's Number and Fermat's theorem" 0 secs ago A visitor from Bangalore. Madhya Pradesh viewed "Life of a CAT aspirant: CoPrimes. Andhra Pradesh viewed "Life of a CAT aspirant: CoPrimes. Andhra Pradesh viewed "Life of a CAT aspirant: CoPrimes. Andhra Pradesh viewed "Life of a CAT aspirant: BlogCatalog onw ardtoiim. Illinois viewed "Life of a CAT aspirant: CoPrimes. Euler's Number and Fermat's theorem" 14 hours 17 mins ago A visitor from Hyderabad. Tamil Nadu viewed "Life of a CAT aspirant: CoPrimes. Euler's Number and Fermat's theorem" 57 mins ago A visitor from Bhopal.html 3/4 . Euler's Number and Fermat's theorem Live Traffic Feed A visitor from Vellore. Karnataka viewed "Life of a CAT aspirant: CoPrimes. Euler's Number and Fermat's theorem" 5 hours 32 mins ago A visitor from Hoffman Estates.in/2008/06/coprimes-eulers-number-and-fermats.of a 10/31/12 CAT aspirant: CoPrimes.

of a 10/31/12 CAT aspirant: CoPrimes. Euler's Number and Fermat's theorem 4/4 .