Find the number of ordered pairs of integers satisfying the following equation,
where
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.
g cd ( 7 , x ) = 1 gives the hint to check for modulo 7.
Since 7 ∣ 2 0 1 6 but 7 does not divides x ,this implies g cd ( 7 , y ! ) = 1 .
This can only happen if y ≤ 6 ,
If we observe that 4 4 2 < 2 0 1 6 → 2 0 1 6 + y ! ≥ 4 5 2 , this gives that y ≥ 4
We check for the cases y = 4 , 5 , 6 we conclude that none of the values give an integer solution for x .