What is the smallest positive integer solution for in the Diophantine equation, ?
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.
Taking,the equation modulo 3,we get: 3 x + 1 3 y ≡ y ≡ 0 m o d 3 Which means that y = 3 y 1 for some positive integer y 1 .
Now taking the equation modulo 13,we get: 3 x + 1 3 y ≡ 3 x ≡ 0 m o d 1 3 → x ≡ 0 m o d 1 3 Which tells us that x = 1 3 x 1 for some positive integer x 1 .Now the given equation becomes: 3 x + 1 3 y = 2 3 4 3 ( 1 3 x 1 ) + 1 3 ( 3 y 1 ) = 2 3 4 x 1 + y 1 = 3 9 2 3 4 x 1 + y 1 = 6 We want to minimize y .To minimize y ,we have to find the smallest positive integer y 1 which satisfies the equation.Obviously, y 1 = 1 is the smallest possible integer value of y 1 ,hence y = 3 y 1 = 3 ( 1 ) = 3 is the smallest possible value of y