What is the smallest positive integer N such that there exists integer (not necessarily positive) solutions ( x , y ) to 2 2 5 x + 2 3 2 5 y = 8 2 8 6 1 + N ?
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.
This is very similar to what I did. Factor out 7 5 , then apply the Chicken McNuggets Theorem, then find the smallest number greater than 8 2 8 6 1 that is divisible by 1 5 .
The Diophantine equation factors into 75(3x+31y) = 82861 + N. We know that since 3, 31 are coprime, there exist integers (x,y) such that 3x+31y=1.
Hence we seek the least positive N such that 82861+N is a multiple of 75. It follows that when N=14, 82861+14=82875 is divisible by 75.
We are given the equation 2 2 5 x + 2 3 2 5 y = 8 2 8 6 1 + N . A little bit of rearrangement gives us,
x = 3 8 2 8 6 1 + N − 2 3 2 5 y
Because x is an integer, thus 8 2 8 6 1 + N − 2 3 2 5 y must be a multiple of 2 2 5 . Thus we have,
8 2 8 6 1 + N − 2 3 2 5 y ≡ 0 ( m o d 2 2 5 )
or N ≡ 2 3 2 5 y − 8 2 8 6 1 ( m o d 2 2 5 ) ≡ 7 5 y − 6 1 ( m o d 2 2 5 )
For integer values of y , the only possible residues are 1 4 , 8 9 and 1 6 4 . Clearly, the minimum among these is 1 4 , which is attained at . . . . . . − 8 , − 5 , − 2 , 1 , 4 , 7 . . . . . . . .
Thus the minimum positive integer value of N is 1 4 .
Typo , in the second step it must read, x = 2 2 5 8 2 8 6 1 + N − 2 3 2 5 y
Rewrite the equation as 75*(3x+31y)=82861+N, So 82861+N must be divided by 75, so the last digit of 82861+N must be 5 or 0, and 82861+14 can be divided, so N is 14.
Take any two numbers say 1 0 and 2 0 .
No matter what combinations of integers you used for x and y , you can never get to the result 1 0 x + 2 0 y = 3 .
In fact you can only get those integers which are an integral multiple of ( 1 0 , 2 0 ) = 1 0 .
So let's return to the problem, we can only find those numbers which are integral multiple of ( 2 2 5 , 2 3 2 5 ) = 7 5 . And the nearest integer greater than 8 2 8 6 1 which is divisible by 7 5 is 8 2 8 7 5 .
So our answer is 8 2 8 7 5 − 8 2 8 6 1 = 1 4 .
See also Bezout's Lemma.
Note that 2 2 5 x + 2 3 2 5 y = 7 5 ( 3 x + 3 1 y ) . As a result, since g cd ( 3 , 3 1 ) = 1 , the possible values taken on by this expression must be multiples of 7 5 . The smallest multiple of 7 5 greater than 8 2 8 6 1 is 8 2 6 7 5 , which gives N = 1 4 .
(Note: one such pair that satisfies this is ( x , y ) = ( 1 7 , 3 4 ) .)
Well, the gcm between 2 2 5 and 2 3 2 5 is 7 5 . Then we know that 7 5 ∣ 8 2 8 6 1 + N , i.e.,
7 5 × k = 8 2 8 6 1 + N ⇒ 7 5 × k − 8 2 8 6 1 > 0 ∴ 7 5 8 2 8 6 1 < k = 1 1 0 5
With this we have 7 5 × 1 1 0 5 = 8 2 8 7 5 = 8 2 8 6 1 + N ∴ N = 1 4 .
2 2 2 x + 2 3 2 5 y = 8 2 8 6 1 + N
Let us simplify the left hand side of this equation by dividing by 7 5
3 x + 3 1 y = 7 5 8 2 8 6 1 + N
Now note that the coefficients of the left hand side are coprime. This means that, by changing the coefficients (including negatively), it is possible to generate any integer value. Therefore, all that is needed is to find the smallest value N such that:
7 5 8 2 8 6 1 + N ∈ Z
Note:
8 2 8 6 1 ÷ 7 5 = 1 1 0 4 . 8 1 3 ˙
Thus the smallest value of N occurs when:
8 2 8 6 1 + N = 7 5 × 1 1 0 5
8 2 8 6 1 + N = 8 2 8 7 5
N = 1 4
A linear Diophantine equation of the form ax + by = c has solutions if and only if gcd(a,b) | c. gcd(225,2325) = 75. As 5 | L.H.S. so 5 | R.H.S. This eases our calculation to find N and we get N = 14.
25 divides LHS so we have that N must be congruent to 14 module 25. The smallest multiple of 25 bigger than 82861 is 82875. So the smallest possible N is 14.
75 divides LHS not 25
Problem Loading...
Note Loading...
Set Loading...
To get integer solutions for the Diophantine Equation, the RHS must be divisible by the greatest common divisor of coefficient of the LHS.
g c d ( 2 2 5 , 2 3 2 5 ) = 7 5 , therefore 8 2 8 6 1 + N must be divisible by 7 5 .
The smallest positive integer value satisfying is 1 4 , as 8 2 8 7 5 is divisible by 7 5 , giving equation 2 2 5 x + 2 3 2 5 y = 8 2 8 7 5
Dividing by 7 5 on both sides of the equation gives 3 x + 3 1 y = 1 1 0 5 , which certainly has many integer solutions, for example ( 3 5 8 , 1 ) , ( 3 2 7 , 4 ) , ( 2 9 6 , 7 ) and so on.