What is the minimum positive integer value of satisfying the condition below?
For every ordered pair of positive integers (with ), there are positive integers and with
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.
Let n = 9 7 x + 9 9 7 y for x , y are non-negative integers then m n = m 9 7 x + 9 9 7 y = ( m x ) 9 7 ( m y ) 9 9 7 = a 9 7 b 9 9 7 where m x = a and m y = b
So, we have to find out largest number n = 9 7 x + 9 9 7 y where there will be no solution
This is a problem of Frobenius Number .Here g c d ( 9 7 , 9 9 7 ) = 1 So ,largest Frobenius number is 9 7 × 9 9 7 − 9 7 − 9 9 7 = 9 5 6 1 5
So, if n = 9 5 6 1 5 + 1 = 9 5 6 1 6 then there will be a solution in ( a , b )