Indeterminate equations and some advanced applications

-
• Sarthak 12/08/2021

Q.1) Given x and y are integers, Find all solution set to the
𝟓 𝟕 𝟏𝟐
equation:→ 𝒙 + 𝒚 = 𝒙𝒚
SOLUTION:- Making the equation denominator free, we get
7x+5y=12 and we know 7(1)+5(1)=12
We get x=1-5k and y=7k+1 for k belonging to integer

Q.2) Jimmy has the high score of 920 in his favourite game. For
each win, he gets 50 point .But for each loss, he loses 36 points.
From just given info figure out the minimum number of games
Jimmy could have played?

SOLUTION:- Let W and L be the number of Jimmy's wins and losses,

respectively. We want to find the minimum value of W+L over the non-
negative integer solutions to➔ 50W-36L=920
Immediately, we know this is equivalent to 25W-18L=460
One approach is to use modular arithmetic to find a solution to 25W -
18L = 1,25W−18L=1, which must exist according to Bezout's identity
since \gcd(25,18) = 1.gcd(25,18)=1. However, it is easy enough to see
that L = 5L=5 gives 18L = 90,18L=90, so (W,L) = (22,5)(W,L)=(22,5) is a
solution to this equation.
Since \gcd(25,18) = 1,gcd(25,18)=1, all solutions to this equation can be
written in the form→ (W,L)=(22+18n,5-25n). for integers n.n. This
gives W+L = 27 - 7n.W+L=27−7n. However, we need WW and LL to be
non-negative, so the largest possible nn is 0, giving W+L =27

Q.3) Gummy bears come in pairs of 6 and 9. IS there a combination of

these packs which gives a total of exactly 100 gummy bears?
SOLUTION:- Let xx and yy be the number of packs of 6 and 9,
respectively. Then, we want to determine whether there is a solution in
positive integers to → 6x + 9y = 100 = 3(2x + 3y)
Since, 100 is not a multiple of 3, hence it is impossible to get
100 gummy bears.

Q.4) Solve the following system of linear Diophantine equations

3x – 4y – z = 5…….(1)
(2)……3y – 4z + 2w = -5 , 2x + w = 10…..(3)
For all the variables belonging to the set of non-negative Integers.
SOLUTION:- After doing all the routine substitution and calculations we
get, z = 3x – 4y – 5 = (85 – 7x)/19 and y = (16x – 45)/(19)
Now, in order for x to be an integer, it must be the case that
16𝑥 – 45 ≡ 0(𝑚𝑜𝑑 19)➔𝑥 ≡ 4(𝑚𝑜𝑑 19). Also since w = 10 - 2x≥0 ,
we have x≤5. Thus, x=4 is the only solution for x. Then we obtain
Y=1 , z=3 , w=2
Q.5) Solve in non-negative integers the
equation→x+y+z+xyz=xy+yz+zx+2
Solution:- xyz − (xy + yz + zx) + x + y + z − 1 = 1

2
From looking at this, we can get some motivation of trying to
factorising it because it has very much symmetric Terms
Now our question is transformed to factorise:-
P(x,y,z) = xyz –( xy + yz + zx) + x + y + z -1
If we put x→1➔p(1,y,z)=0
Hencey it has a factor of (x-1)
So maybe once try expanding g(x)=(x-1)(y-1)(z-1)
Magically both the p(x,y,z) are exactly same

So at starting we had, xyz – (xy + yz + zx) + x +y + z – 1 = 1

Which is➔ (x-1)(y-1)(z-1)=1
Because x, y,z are nonnegative integers, we obtain, x-1 = y-1 = z-1 = 1
Hence , x=y=z=2

Q.6) Let p,q be prime numbers, Find all positive integers x and y such
1 1 1
that. 𝑥 + 𝑦 = 𝑝𝑞

SOLUTION:- The equation is equivalent to (𝑥 − 𝑝𝑞)(𝑦 − 𝑝𝑞) = (𝑝𝑞)2

We have the cases:

(𝟏) 𝒙 − 𝒑𝒒 = 𝟏, 𝒚 − 𝒑𝒒 = 𝒑𝟐 𝒒𝟐 , 𝒔𝒐 𝒙 = 𝟏 + 𝒑𝒒, 𝒚 = 𝒑𝒒(𝟏 + 𝒑𝒒).
(𝟐) 𝒙 − 𝒑𝒒 = 𝒑, 𝒚 − 𝒑𝒒 = 𝒑 𝒒𝟐 , 𝒔𝒐 𝒙 = 𝒑(𝟏 + 𝒒), 𝒚 = 𝒑𝒒(𝟏 + 𝒒).
(𝟑) 𝒙 − 𝒑𝒒 = 𝒒, 𝒚 − 𝒑𝒒 = 𝒑𝟐 𝒒, 𝒔𝒐 𝒙 = 𝒒(𝟏 + 𝒑), 𝒚 = 𝒑𝒒(𝟏 + 𝒑).
(𝟒)𝒙 − 𝒑𝒒 = 𝒑𝟐, 𝒚 − 𝒑𝒒 = 𝒒𝟐 , 𝒔𝒐 𝒙 = 𝒑(𝒑 + 𝒒), 𝒚 = 𝒒(𝒑 + 𝒒).
(𝟓)𝒙 − 𝒑𝒒 = 𝒑𝒒, 𝒚 − 𝒑𝒒 = 𝒑𝒒, 𝒔𝒐 𝒙 = 𝟐𝒑𝒒, 𝒚 = 𝟐𝒑𝒒

3
 𝑻𝒉𝒆 𝒆𝒒𝒖𝒂𝒕𝒊𝒐𝒏 𝒊𝒔 𝒔𝒚𝒎𝒎𝒆𝒕𝒓𝒊𝒄, 𝒔𝒐 𝒘𝒆 𝒉𝒂𝒗𝒆 𝒂𝒍𝒔𝒐:
(𝟔) 𝒙 = 𝒑𝒒(𝟏 + 𝒑𝒒), 𝒚 = 𝟏 + 𝒑𝒒.
(𝟕) 𝒙 = 𝒑𝒒(𝟏 + 𝒒), 𝒚 = 𝒑(𝟏 + 𝒒).
(𝟖) 𝒙 = 𝒑𝒒(𝟏 + 𝒑), 𝒚 = 𝒒(𝟏 + 𝒑).
(𝟗)𝒙 = 𝒒(𝟏 + 𝒒), 𝒚 = 𝒑(𝒑 + 𝒒).

Q.7) The integer N is positive. There are exactly 2005 ordered pairs of
(x,y) of positive integers satisfying 1/z + 1/y = 1/N
Prove that N is perfect sqaure
SOLUTION:- The equation is equivalent to →(𝑥 − 𝑛)(𝑦 − 𝑛) = 𝑛2
𝑛2
For any divisor d of n^2, we have (𝑥 − 𝑛, 𝑦 − 𝑛) = (𝑑 , ) is a valid
𝑑
solution pair. So, the number of solution equals the
𝑎 𝑎 𝑎
number of divisors of d. So if d=𝑃1 1 𝑃2 2 ........𝑃𝑘 𝑘 , then
(2𝑎1 + 1)(2𝑎2 + 1) … … (2𝑎𝑘 + 1) = 2005 = 5×401
Hence, we find either k = 1 and a_1 =1002, or k=2 (𝑎1 , 𝑎2 ) = (2,200)
In either case, 𝛼𝑖 are all even meaning n is a square number.

Q.8) Under what conditions on a,b,c is that the equation ax+by+cz=1

has a solution ?
SOLUTION:- Refer to image attached on next page

4
Q.9) Find all the integer solution to 6x+15y+20z=1
SOLUTION:- Refer to just above question

Q.10) Find all the integer solutions to:

12345x+67890y=gcd(12345,67890)

SOLUTION:- By cancelling common factors , 4526y+823x=1

By Euclids division algorithm, 4526(−2) + 823(11) = 1
Hence , y=823n-2 and x=11-4526n

Q.11) For each of the following pairs of (a,b) , find the largest number
that is not of the form ax+by for x,y≥0
(I) {a,b}={5,7}
SOLUTION:-

5
• In 𝑎2 Column, any number ≥7 is L(5,7) because those all numbers
can be written as 7+5k for some non-negative integer k
• In 𝑎1 column, any Number ≥21 is L(5,7) because those all numbers
can be written was 7(3)+5k for some non-negative integer k
• In 𝑎3 column, any Number ≥28 is L(5,7) because all those numbers
can be written 7(4)+5k for some non-negative integer k
• In 𝑎4 column, any number ≥14 can be written is L(5,7) because all
those numbers can be written as 7(2)+5k for some non-negative
integer k
• In 𝑎5 column, any number is L(5,7) because all those numbers of
non-negative integer multiples of 5

After knowing all these things, we can easily see 23 is the largest
integer which is not L(5,7)

6
 (ii) {a,b}={4,11}
SOLUTION:- Do the same as done above

(#) Chicken Mcnugget Theorem (#)

• Let’s define some terms, Any natural number ‘N’ is L(a,b) if
and only if it can be written as an+bm for some m,n being
non-negative integers
• Take any two non-negative integers (a,b) such that
gcd(a,b)=1. So Chicken mcnugget Theorem States that the
maximum integer which is not L(a,b) = ab-a-b
• For example , take (a,b)=(5,6). So by the given theorem the
maximum integer which is L(5,6)= (5×7)-5-7=23

Q.16) Find the sum of all positive integers such that, given an
unlimited supply of stamps of denominations and
cents, cents is the greatest postage that cannot be formed

SOLUTION:-. Obviously . We see that the problem's

condition is equivalent to: 96 is the smallest number
that can be formed which is 1 mod 5, and 92, 93, 94 can
be formed (95 can always be formed). Now divide this
up into cases. If , then 91 can be formed by
using and some 5's, so there are no solutions for
this case. If , then 91 can be formed by

7
 using and some 5's, so there are no solutions for this
case either
For , is the smallest value that can be
formed which is 1 mod 5, so and . We see
that , , and , so does
work. If , then the smallest value that can be
formed which is 1 mod 5 is , so and .
We see that and , but 92 cannot be
formed, so there are no solutions for this case.
If , then we can just ignore since it is a
multiple of 5, meaning that the Chicken McNugget
theorem is a both necessary and sufficient condition,
and it states that meaning and .
Hence, the only two that work are and , so
our answer is

Homework Q.13) …..{USAMO 2001/5}

• Let be a set of integers (not necessarily positive) such that
(a) there exist with ;
(b) if and are elements of (possibly equal),then also
belongs to .
Prove that is the set of all integers