Let ( a , b ) are positive integers such that
⎩ ⎪ ⎪ ⎨ ⎪ ⎪ ⎧ g cd ( a , b ) = 1 , b ≤ 1 0 0 , ( b a − [ b a ] ) [ b a ] = 2 0 1 3 ,
where [ x ] Is the Largest Integer Not Greater Than x
Find the total number of pairs ( a , b ) .
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.
I did the same solution but forgot that g.c.d(r,b)=1 and entered the wrong answer.
Log in to reply
I did the same error but got the answer after I rechecked my solution
How do you know that r ∣ 2 0 1 3 ? I never saw an argument like g cd ( l , 2 0 1 3 ) = 1 that would let us deduce that.
Problem Loading...
Note Loading...
Set Loading...
Let a = k b + r , Where k , r ∈ Z $ and 0 ≤ r < b . Since g cd ( a , b ) = 1 , We have g cd ( r , b ) = 1 .
Now the third equation becomes b r k = 2 0 1 3 , So b ∣ r k . Since g cd ( r , b ) = 1 , We get b ∣ k . Let k = l b , l ∈ Z , so r l = 2 0 1 3 .
Now r ∣ 2 0 1 3 and r < b ≤ 1 0 0 , So r = 1 , 3 , 1 1 , 3 3 , 6 1 .
At this point, note that each choice of r , b such that r < b ≤ 1 0 0 , r ∣ 2 0 1 3 and g cd ( r , b ) = 1 corresponds to exactly one solution for ( a , b ) . (Since a = k b + r = l b 2 + r = r 2 0 1 3 b 2 + r )
If r = 1 , We have 1 < b ≤ 1 0 0 , g cd ( b , 1 ) = 1 , Giving 9 9 solutions for b .
If r = 3 , We have 3 < b ≤ 1 0 0 , g cd ( b , 3 ) = 1 , Giving 9 7 − 3 2 = 6 5 solutions for b .
If r = 1 1 , We have 1 1 < b ≤ 1 0 0 , g cd ( b , 1 1 ) = 1 , Giving 8 9 − 8 = 8 1 solutions for b .
If r = 3 3 , We have 3 3 < b ≤ 1 0 0 , g cd ( b , 3 3 ) = 1 , Giving 6 7 − 2 2 − 6 + 2 = 4 1 solutions for b .
If r = 6 1 , We have 6 1 < b ≤ 1 0 0 , g cd ( b , 6 1 ) = 1 , Giving 3 9 solutions for b .
This gives a Total of 3 2 5 solutions for ( r , b ) and hence for ( a , b ) .