{ 2 0 0 3 1 , 2 0 0 2 2 , 2 0 0 1 3 , 2 0 0 0 4 , … , 1 2 0 0 3 }
For each of the 2003 fractions above, the sum of the numerator and denominator equal 2004. Find the number of fractions less than 1 which are irreducible.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Hi Firstly, This question is asking for fractions lesser than one. Hence we only consider 2 0 0 3 1 to 1 0 0 3 1 0 0 1 Now, for the fraction 2 0 0 4 − n n to be reducible, n must be a factor or 2004. The factors of 2004 which are smaller than 1002 are 2,3.4.6,12,167,334,501,668(not considering 1). So what we are trying to find now is the number of fractions from 2 0 0 3 1 to 1 0 0 3 1 0 0 1 which have their numerators being a factor of 2004. Hence we need to find the amount of numbers which are a multiple of 2,3,167 from 1-1001(The other factors are taken out as they are just multiple of those prime factors). Set A:Multiple of 2s Set B:Multiple of 3s Set C:Multiple of 167s AUBUC=A+B+C-AnB-BnC-AnC+AnBnC =500+333+5-166-1-2+0(not applicable) =669 This are the number of fractions which are REDUCIBLE. Hence the number of non-reducible fractions are 1001-669 =332 U stands for union while n stands for intersects(i am bad at latex)
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Euler's Totient Function
We note that the general form of the fraction is 2 0 0 4 − n n = n 2 0 0 4 − 1 1 , where n = 1 , 2 , 3 , . . . 2 0 0 3 . We also note that the fraction is irreducible when n 2 0 0 4 is irreducible or n and 2 0 0 4 are coprime integers. The number of 2003 fractions which is irreducible is the number of coprime integers of 2004 less than 2004, which is Euler's totient function of 2004:
ϕ ( 2 0 0 4 ) = 2 0 0 4 ( 1 − 2 1 ) ( 1 − 3 1 ) ( 1 − 1 6 7 1 ) = 6 6 4 where 2, 3 and 167 are prime factors of 2004. .
Since: { 2 0 0 3 1 , 2 0 0 2 2 , ⋯ 1 0 0 3 1 0 0 1 , 1 0 0 2 1 0 0 2 , 1 0 0 1 1 0 0 3 , ⋯ 2 2 0 0 2 , 1 2 0 0 3 } = { 2 0 0 3 1 , 2 0 0 2 2 , ⋯ 1 0 0 3 1 0 0 1 , 1 , 1 0 0 3 1 0 0 1 1 , ⋯ 2 0 0 2 2 1 , 2 0 0 3 1 1 } , we note that half of the irreducible fractions are less than 1 and the other half greater than 1. Therefore, the number of irreducible less than 1 is 2 6 6 4 = 3 3 2 .