返回题库

AIME 2014 I · 第 3 题

AIME 2014 I — Problem 3

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem 3

Find the number of rational numbers rr, 0,suchthatwhen0, such that whenr$ is written as a fraction in lowest terms, the numerator and the denominator have a sum of 1000.

解析

Solution 1 (Euclidean algorithm, fast)

Let the numerator and denominator x,yx,y with gcd(x,y)=1\gcd(x,y)=1 and x+y=1000.x+y = 1000. Now if gcd(x,y)=1\gcd(x,y) = 1 then gcd(x,y)=gcd(x,1000x)=gcd(x,1000x(1)x)=gcd(x,1000)=1.\gcd(x,y) =\gcd(x,1000-x)= \gcd(x,1000-x-(-1)x)=\gcd(x,1000)=1. Therefore any pair that works satisfies gcd(x,1000)=1.\gcd(x,1000)= 1. By Euler's totient theorem, there are ϕ(1000)=400\phi(1000) = 400 numbers relatively prime to 1000 from 1 to 1000. Recall that r=xy<1r=\frac{x}{y}<1 and note by Euclidean algorithm gcd(1000,1000x)=1\gcd(1000,1000-x)=1, so we want xThusthex Thus the400relativelyprimenumberscangeneraterelatively prime numbers can generate\boxed{200}$ desired fractions.

Solution 2

If the initial manipulation is not obvious, consider the Euclidean Algorithm. Instead of using nm\frac{n}{m} as the fraction to use the Euclidean Algorithm on, we can rewrite this as 500x500+x\frac{500-x}{500+x} or

gcd(500+x,500x)=gcd((500+x)+(500x),500x)=gcd(1000,500x).\gcd(500+x,500-x)=\gcd((500+x)+(500-x),500-x)=\gcd(1000,500-x). Thus, we want gcd(1000,500x)=1\gcd(1000,500-x)=1. You can either proceed as Solution 11, or consider that no even numbers work, limiting us to 250250 choices of numbers and restricting xx to be odd. If xx is odd, 500x500-x is odd, so the only possible common factors 10001000 and 500x500-x can share are multiples of 55. Thus, we want to avoid these. There are 5050 odd multiples of 55 less than 500500, so the answer is 25050=200250-50=\boxed{200}.

Solution 3

Say r=d1000dr=\frac{d}{1000-d}; then 1d4991\leq d\leq499. If this fraction is reducible, then the modulus of some number for dd is the same as the modulus for 1000d1000-d. Since 1000=23531000=2^3\cdot5^3, that modulus can only be 22 or 55. This implies that if d2d\mid2 or d5d\mid5, the fraction is reducible. There are 249249 cases where d2d\mid2, 9999 where d5d\mid5, and 4949 where d(25=10)d\mid(2\cdot5=10), so by PIE, the number of fails is 299299, so our answer is 200\boxed{200}.

Solution 4

We know that the numerator of the fraction cannot be even, because the denominator would also be even. We also know that the numerator cannot be a multiple of 55 because the denominator would also be a multiple of 55. Proceed by listing out all the other possible fractions and we realize that the numerator and denominator are always relatively prime. We have 499499 fractions to start with, and 250250 with odd numerators. Subtract 5050 to account for the multiples of 55, and we get 200\boxed{200}.

Solution 5

We know that the set of these rational numbers is from 1999\dfrac{1}{999} to 499501\dfrac{499}{501} where each each element nm\dfrac{n}{m} has n+m=1000n+m =1000 and nm\dfrac{n}{m} is irreducible.

We note that nm=1000mm=1000m1\dfrac{n}{m} =\dfrac{1000-m}{m}=\dfrac{1000}{m}-1. Hence, nm\dfrac{n}{m} is irreducible if 1000m\dfrac{1000}{m} is irreducible, and 1000m\dfrac{1000}{m} is irreducible if mm is not divisible by 22 or 55. Thus, the answer to the question is the number of integers between 501501 and 999999 inclusive that are not divisible by 22 or 55.

We note there are 499499 numbers between 501501 and 999999, and

  • 249249 numbers are divisible by 22
  • 9999 numbers are divisible by 55
  • 4949 numbers are divisible by 1010

Using the Principle of Inclusion and Exclusion, we get that there are 49924999+49=200499-249-99+49=200 numbers between 501501 and 999999 are not divisible by either 22 or 55, so our answer is 200\boxed{200}.

Euler's Totient Function can also be used to arrive at 400400 numbers relatively prime to 10001000, meaning 200200 possible fractions satisfying the necessary conditions. Solution 1 is a more detailed solution utilizing Euler's totient.

Solution 6

We notice that there are a total of 400400 fractions that are in simplest form where the numerator and denominator add up to 10001000. Because the numerator and denominator have to be relatively prime, there are φ(1000)=400\varphi(1000)=400 fractions. Half of these are greater than 11, so the answer is 400÷2=200400\div2=\boxed{200}

- bedwarsnoob

~MathFun1000 (Minor Edits)

Solution 7

Our fraction can be written in the form 1000aa=1000a1.\frac{1000 - a}{a} = \frac{1000}{a} - 1. Thus the fraction is reducible when aa divides 1000.1000. We also want 500<a<1000.500 < a < 1000. By PIE, the total values of aa that make the fraction reducible is,

249+9949=299.249 + 99 - 49 = 299. By complementary counting, the answer we want is 499299=200.499 - 299 = \boxed{200}.

Solution 8 (Simplest)

Suppose our fraction is ab\frac{a}{b}. The given condition means a+b=1000a+b=1000. Now, if aa and bb share a common factor greater than 11, then the expression a+ba+b must also contain that common factor. This means our fraction cannot have a factor of 55 or be even.

There are 250250 fractions that aren’t even. From this, 5050 are divisible by 55, which means the answer is 25050=200250-50=\boxed{200}

~Geometry285