5 7 1 5 = 7 1
When teaching children how to reduce fractions, many of them will make mistakes like the one shown above. However, there are a few situations in which making this error does yield the correct answer, that is, B C A B = C A . For how many fractions would this method of simplification work?
Note: A B simply denotes the decimal expansion of a two-digit number with A and B as the digits.
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.
Beautiful, I really need to remember that trick that of expanding out the top in terms of the bottom to get an integer; I've seen you use it before and it's genius. Does the trick have a name or did you come up with it yourself?
Log in to reply
Thanks Garrett. It's just use of simple divisibility rules! See my response to @Saarthak Marathe .
@Garrett Clarke - What about this?
c a a b = c b ??
Log in to reply
I thought about having the question include this method of cancellation as well, until I realized that the solutions to this equation are just the reciprocals of the first equation!
Log in to reply
@Garrett Clarke – Haha! Correct ! I actually had solved this version of the problem!
"Mistakes give rise to problems" @Aditya Raut
Log in to reply
Oh dang has he made this problem before?
Log in to reply
No, I don't think so. But there was a very famous set of problems related to this which he posted. You must check it out if you haven't. They are just like this problem of yours.
That's a superb set of problems!
What if d=3,6,9 and how did a+1|10(a+1)-10a term come from?
Log in to reply
Possible values of b covers those of d . For second question, I explained it for someone before in this question .
If integer x is a common divisor of y and z , then it divides every linear combination of y and z . In other words if x ∣ y and x ∣ z then x ∣ m y + n z for arbitrary integers m and n .
Now for your question let x = a + 1 , now we must have a + 1 ∣ 1 0 a , so let y = 1 0 a and a + 1 ∣ a + 1 , so let z = a + 1 . I choose m and n in a way that degree of a decreases on the RHS of relations. Look for example if m = − 1 and n = 1 0 we get a + 1 ∣ 1 0 ( a + 1 ) − 1 0 a = 1 0 . I hope I'm clear.
Log in to reply
Thank you very much Kazem!
Another outstanding solution from you!
Clearly we have the 9 trivial solutions where A = B = C , for example 3 3 3 3 = 3 3 = 1 .
Now to find the non-trivial solutions. We start by replacing A B = 1 0 a + b and B C = 1 0 b + c :
1 0 b + c 1 0 a + b = c a
c ( 1 0 a + b ) = a ( 1 0 b + c )
1 0 a c + b c = 1 0 a b + a c
b ( 1 0 a − c ) = 9 a c
b = 1 0 a − c 9 a c
Since b is an integer, we know that ( 1 0 a − c ) ∣ 9 a c . For 1 ≤ a , c ≤ 9 , we get the following triples ( a , b , c ) :
( 1 , 6 , 4 ) ⟹ 6 4 1 6 = 4 1
( 1 , 9 , 5 ) ⟹ 9 5 1 9 = 5 1
( 2 , 6 , 5 ) ⟹ 6 5 2 6 = 5 2
( 4 , 9 , 8 ) ⟹ 9 8 4 9 = 8 4 = 2 1
There are four more triples, ( 1 , 2 1 , 7 ) , ( 1 , 3 6 , 8 ) , ( 1 , 8 1 , 9 ) & ( 2 , 1 2 , 8 ) , but since 1 ≤ b ≤ 9 , we must disregard these solutions.
Therefore we have 4 non-trivial solutions and 9 trivial solutions, giving us our final answer of 1 3 .
How did you find the list of triples? Did you have to trial and error search through all possible pairs ( a , c ) ?
Log in to reply
Wish I had a better answer than I checked all values of a and c with a java program, but sadly I do not.
Log in to reply
In that case, why did you have to do all of that initial work? Why not just check if b c a b = c a ?
Log in to reply
@Calvin Lin – Well I knew that I would only have to check values that made the bottom a number that would divide 9, other than that there really was no method. I believe that @Kazem Sepehrinia certainly has the best solution in this case, he has received my upvote!
I got all 13 solutions that you got, but I wanted to ask you that in those 4 cases where A,B,C are distinct, like take for example (1,6,4) for A,B,C respectively. Why are solutions like (4,1,6),(4,6,1),(1,4,6),(6,4,1) and (6,1,4) unacceptable?
Log in to reply
Those solutions are unacceptable because those triples are merely ways of representative what we are really trying to find: fractions. The triple ( 1 , 6 , 4 ) translates to 6 4 1 6 , which as we can see works with our method of simplification. If we tried the triple ( 4 , 1 , 6 ) , we get 1 6 4 1 which reduces to 6 4 using our method, but this fraction clearly cannot be reduced because 4 1 is prime. The triples are as such that they can only be used in one specific order. Thanks for the question!
Log in to reply
I didn't understand why 41/16 doesn't work. You will cancel the one to get 4/6 which is nothing but A/C.
Log in to reply
@Kushagra Sahni – Right, but we are looking for fractions B C A B = C A . 1 6 4 1 = 6 4 , therefore 1 6 4 1 is not a solution.
Log in to reply
@Garrett Clarke – Oh hi I understood. So You mean to say that the actual fraction should also equal A/C .
Log in to reply
@Kushagra Sahni – Yes, is the question unclear? Should I rephrase it?
Log in to reply
@Garrett Clarke – No not at all mate. I understood it when I first read it and even found out all 13 solutions. But as soon as I found them four of them confused me a bit in which a,b,c were unequal. They made me think that why can't there be 6 solutions from each of that triplet. And this made be completely forget the question. Then I asked you this. Now this morning I saw your replies and remembered the question. So a very nice question from you keep posting more of these sort .
It is not clear from the wording of the question that we need to ignore the cases where A = B = 0, in which case the answer would increase from 13 to 22. . Could you please clarify this in the problem statement?
We can't have A = B = 0 because then A B = 0 0 = 0 , which is clearly not a two-digit number as stated by the question.
ya.. we can not hv A=B=0
Discard the degenerate solutions where A = B = 0, because we want two-digit numbers without leading zeros. And discard C=0 because it causes a division by 0. So below we will assume A, B and C to be nonzero digits.
B C A B = C A ⇔ 1 0 B + C 1 0 A + B = C A ⇔ 1 0 A C + B C = 1 0 A B + A C ⇔ 9 A C = B ( 1 0 A − C )
Observe that B ( A − C ) ≡ 0 ( m o d 9 ) . So A = C ∨ B = 9 ∨ ( 3 ∣ B ∧ 3 ∣ ( A − C ) )
If A = C = 0 , then the fraction A / C evaluates to 1 implying A B = B C so that A = B = C
If B = 9 then A C = 1 0 A − C ⇒ C = 1 0 A / ( A + 1 ) leading to ( A , C ) ∈ { ( 1 , 5 ) ( 4 , 8 ) ( 9 , 9 ) }
If B = 3 then 3 A C = 1 0 A − C ⇒ C = 1 0 A / ( 3 A + 1 ) leading to ( A , C ) ∈ { ( 3 , 3 ) }
If B = 6 then 3 A C = 2 0 A − 2 C ⇒ C = 2 0 A / ( 3 A + 2 ) leading to ( A , C ) ∈ { ( 1 , 4 ) ( 2 , 5 ) ( 6 , 6 ) }
Summarized, we found 1 3 solutions: 1 1 1 1 = 1 1 , 2 2 2 2 = 2 2 , . . . , 9 9 9 9 = 9 9 , 9 5 1 9 = 5 1 , 9 8 4 9 = 8 4 , 6 4 1 6 = 4 1 , 6 5 2 6 = 5 2
I know none of you look for this but I am going to post it anyway.
for i in range(1, 10):
for j in range(1, 10):
for k in range(1, 10):
if (i * 10 + j) / (j * 10 + k) == i / k:
print(i, j, k)
Simple. Concise. Adaptive.
for(int a=1;a<10;a++)
{for(int b=1;b<10;b++)
{ for(int c=0;c<10;c++)
{if(9 a c+b c-10 a*b==0)
System.out.println("("+a+","+b+") ("+b+","+c+")");
}
}
}
WRITE THIS CODING ON THE ACTION PERFORMED EVENT OF A BUTTON IN NETBEANS. U GET THE RESULT.
(1,1) (1,1) (1,6) (6,4) (1,9) (9,5) (2,2) (2,2) (2,6) (6,5) (3,3) (3,3) (4,4) (4,4) (4,9) (9,8) (5,5) (5,5) (6,6) (6,6) (7,7) (7,7) (8,8) (8,8) (9,9) (9,9)
Problem Loading...
Note Loading...
Set Loading...
Using Garrett's notation A B = 1 0 a + b , B C = 1 0 b + c we get 1 0 b + c 1 0 a + b = c a b ( 1 0 a − c ) = 9 a c Note that a , b and c are nonzero digits. c = a is our trivial case, for a = c let d = c − a . Its clear that d cannot take ± 9 . Equation becomes b ( 9 a − d ) = 9 a ( a + d ) 9 a 2 + 9 a ( d − b ) + b d = 0 It's immediate that 9 ∣ b d and since d = ± 9 only possible values for b are 3 , 6 , 9 .
For b = 3 c = 3 a + 1 1 0 a and we must have 3 a + 1 ∣ 1 0 ( 3 a + 1 ) − 3 ( 1 0 a ) = 1 0 , which gives a = 3 only and this is one of trivial solutions.
For b = 6 c = 3 a + 2 2 0 a and we must have 3 a + 2 ∣ 2 0 ( 3 a + 2 ) − 3 ( 2 0 a ) = 4 0 , which gives a = 1 , 2 , 6 and leads to ( a , b , c ) = ( 1 , 6 , 4 ) , ( 2 , 6 , 5 ) and trivial solution ( 6 , 6 , 6 ) .
For b = 9 c = a + 1 1 0 a and we must have a + 1 ∣ 1 0 ( a + 1 ) − 1 0 a = 1 0 , which gives a = 1 , 4 , 9 and leads to ( a , b , c ) = ( 1 , 9 , 5 ) , ( 4 , 9 , 8 ) and trivial solution ( 9 , 9 , 9 ) .
We are done.