The denominators of two irreducible fractions are 600 and 700. Find the minimum value of the denominator of their sum when it is written as an irreducible fraction.
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.
Good clear solution.
Instead of "irreducible with", you mean "coprime to".
Excellent proof. FYI, the correct terminology is "coprime to", not "irreducible with". Individual numbers are irreducible/prime or not; being coprime describes whether two numbers have a common factor or not.
How can you know A=1, B=3 will cancel out 25 in the denominator?
Log in to reply
In general, any A = 2 5 k + 1 , B = 2 5 l + 3 will do. What I did was trying to solve 6 A + 7 B = 2 5 . It happens to work.
Exactly Same Way.
We can write this problem in the form of:
6 0 0 a + 7 0 0 b = d c , where a, b, c, d are positive integers and gcd(a,600) = gcd(b,700) = gcd(c,d) = 1. We need to find the minimum value of d.
It is easy to see, that
6 0 0 a + 7 0 0 b = 4 2 0 0 7 a + 6 b
We can get the minimum value of d by simplifying the fraction on the RHS (which therefore has to be a factor of 4200).
4200= 2 3 × 3 × 5 2 × 7
Now, we will show, that we can simplify by 5 2 = 2 5 , but not any further:
As 17×7+1×6=125 :
6 0 0 1 7 + 7 0 0 1 = 4 2 0 0 1 2 5 = 2 5 × 1 6 8 2 5 × 5 = 1 6 8 5
However, we cannot simplify by any other prime factor of 4200 (2, 3 or 7) than 5, because:
If we could simplify by 2, then there would be an m=2k (positive integer), that
7a + 6b = 2k
If we rearrange this, we get
7a = 2(k-3b)
This can only happen, if a is divisible by 2, which is impossible as gcd(a,600)=1 (the fraction is irreducible according to the question) and 2 is a factor of 600.
Similarly, we cannot simplify by 3 either, as then there would be an m=3k, 7a = 3(k-2b), a cannot be divisible by 3 (as then gcd(a,600) would be at least 3, which contradicts the condition of the question .
And we can't simplify by 7, as then there would be an n=7p, that
7a + 6b = 7p
6b = 7(a-p)
and b cannot be divisible by 7 since gcd(b,700)=1.
For the reasons above, the solution is 1 6 8 .
Thanks for the solution
Thank you for your excellent solution. May i ask you what your studying currently? I've never come across irreducible fractions before.
Problem Loading...
Note Loading...
Set Loading...
Write 6 0 0 A + 7 0 0 B = 4 2 0 0 7 A + 6 B .
The prime decomposition of 4 2 0 0 (the denominator) is 2 3 . 3 . 5 2 . 7 , we are attempting to make the numerator share as many similar factors as possible to cancel them out in order to minimize the denominator.
Note that it is impossible for 7 A + 6 B to be even since this implies A must be even. However, we know that this is impossible since A is coprime to 6 0 0 . Therefore, 2 3 will remain in the denominator.
Also, it is impossible for 7 A + 6 B to be divisible by 3 since this implies A is divisible by 3 . However, we know that this is impossible since A is coprime to 6 0 0 . Therefore, 3 will remain in the denominator.
By the same reasoning, it is impossible for 7 A + 6 B to be divisible by 7 since this implies B is divisible by 7 . However, we know that this is impossible since B is coprime to 7 0 0 . Therefore, 7 will remain in the denominator.
However, it is easy to cancel out 2 5 in the denominator. Just let A = 1 , B = 3 and we get 4 2 0 0 2 5 = 1 6 8 1 .
Therefore, the minimum value of the denominator is 1 6 8 .