So Many Constraints!

Let ( a , b ) (a,b) are positive integers such that

{ gcd ( a , b ) = 1 , b 100 , ( a b [ a b ] ) [ a b ] = 2013 , \begin{cases} \gcd(a,b)=1, \\ b\le 100, \\ \left(\dfrac{a}{b}-\left[\dfrac{a}{b}\right]\right)\left[\dfrac{a}{b}\right]=2013, \end{cases}

where [ x ] [x] Is the Largest Integer Not Greater Than x x

Find the total number of pairs ( a , b ) (a,b) .


The answer is 325.

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.

1 solution

Gabriel Merces
Apr 11, 2014

Let a = k b + r a=kb+r , Where k , r Z $ k, r \in \mathbb{Z}\$ and 0 r < b 0 \leq r < b . Since gcd ( a , b ) = 1 \gcd(a, b)=1 , We have gcd ( r , b ) = 1 \gcd(r, b)=1 .

Now the third equation becomes r b k = 2013 \frac{r}{b}k=2013 , So b r k b \mid rk . Since gcd ( r , b ) = 1 \gcd(r,b)=1 , We get b k b \mid k . Let k = l b , l Z k=lb, l \in \mathbb{Z} , so r l = 2013 rl=2013 .

Now r 2013 r \mid 2013 and r < b 100 r < b \leq 100 , So r = 1 , 3 , 11 , 33 , 61 r=1, 3, 11, 33, 61 .

At this point, note that each choice of r , b r, b such that r < b 100 , r 2013 r < b \leq 100, r \mid 2013 and gcd ( r , b ) = 1 \gcd(r, b)=1 corresponds to exactly one solution for ( a , b ) (a, b) . (Since a = k b + r = l b 2 + r = 2013 r b 2 + r a=kb+r=lb^2+r=\frac{2013}{r}b^2+r )

If r = 1 r=1 , We have 1 < b 100 , gcd ( b , 1 ) = 1 1 < b \leq 100, \gcd(b, 1)=1 , Giving 99 99 solutions for b b .

If r = 3 r=3 , We have 3 < b 100 , gcd ( b , 3 ) = 1 3 < b \leq 100, \gcd(b, 3)=1 , Giving 97 32 = 65 97-32=65 solutions for b b .

If r = 11 r=11 , We have 11 < b 100 , gcd ( b , 11 ) = 1 11 < b \leq 100, \gcd(b, 11)=1 , Giving 89 8 = 81 89-8=81 solutions for b b .

If r = 33 r=33 , We have 33 < b 100 , gcd ( b , 33 ) = 1 33 < b \leq 100, \gcd(b, 33)=1 , Giving 67 22 6 + 2 = 41 67-22-6+2=41 solutions for b b .

If r = 61 r=61 , We have 61 < b 100 , gcd ( b , 61 ) = 1 61 < b \leq 100, \gcd(b, 61)=1 , Giving 39 39 solutions for b b .

This gives a Total of 325 325 solutions for ( r , b ) (r,b) and hence for ( a , b ) (a, b) .

I did the same solution but forgot that g.c.d(r,b)=1 and entered the wrong answer.

mietantei conan - 7 years ago

Log in to reply

I did the same error but got the answer after I rechecked my solution

Ayush Garg - 6 years, 11 months ago

How do you know that r 2013 r\mid 2013 ? I never saw an argument like gcd ( l , 2013 ) = 1 \gcd(l,2013)=1 that would let us deduce that.

mathh mathh - 6 years, 12 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...