Scribd
Upload
131 views3 pages

IOQM - Practice Sheet-1 - (Answer Key & Sol.)

Uploaded by

K Siddharth
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
131 views3 pages

IOQM - Practice Sheet-1 - (Answer Key & Sol.)

Uploaded by

K Siddharth
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

IOQM (2024) Practice Sheet-1

Corporate Office : Aakash Tower, 8, Pusa Road, New Delhi-110005


Ph.: 011-47623456

Indian Olympiad Qualifier in Mathematics


Practice Sheet-1
Answers
1. (C)
2. (C)
3. (n = 2)
4. (06)
5. (x = –1 + 5k, y = 2 – 3k)
6. (x = 22 + 173k, y = 253 + 190 k)
7. (x = 16k – 2, y =1 – 7k)
8. (8)
9. (3, 4), (4, 3), (0, 7), (7, 0)
10. (07)
11. (01)

Corporate Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Page [2]
IOQM (2024) Practice Sheet-1

Solution

1. Answer (C) integer k, 2002k = 3ak + 1 for some integer ak.


d456d → divisible by 18 Thus 2002k + 2 is divisible by 3. Because 2 and 3
 divisible by 2 and 9 are relatively prime, every number in the
To be divisible by 2, d must be even sequence is divisible by 6. Therefore, g = 6.
d = 0, 2, 4, 6, 8 5. Answer (x = –1 + 5k, y = 2 – 3k)
No. to be divisible by 9, sum of digits are divisible 3(–1) + 5(2) = 7
by 9. x = –1 + 5k
 d + 4 + 5 + 6 + d divisible by 9 y = 2 – 3k

 6 + 2d → divisible by 9 Where k is an arbitrary integer.

Put d = 4 6. Answer (x = 22 + 173k, y = 253 + 190 k)

6 + 8 → Not divisible by 9 The coefficients in the equation are large enough

Put d = 6 to make it difficult to find a particular solution.

6 + 12 → divisible by 9 However, it is not hard to see that the numbers

2. Answer (C) 1990 and 173 are relatively prime, and this helps.

The given equation implies y  1 (mod10), only C The greatest common divisor (gcd) of these

is possible. By checking (C) is a solution. Thus numbers can be represented as 1990m – 173n

the answer is (C). for some integers m and n

3. Answer (n = 2) Euclid’s algorithm gives us m = 2, n = 23.

The sum of the three numbers is an even number, Hence x0 = 2x11 =22, y0 = 23x11 = 253 is a

so at least one of them is even. The only even solution to the equation1990 – 173y = 11

prime number is 2. Only 3n – 4 and 5n – 3 can be x = x0 + 173k = 22 + 173k,

even. Solving the equations 3n – 4 = 2 and y = y0 + 1990k = 253 + 1990k, where k is any

5n – 3 = 2 yields n = 2 and n = 1, respectively. It integer

is trivial to check that n = 2 does make all three 7. Answer (x = 16k – 2, y =1 – 7k)

given numbers prime. 21x + 48y = 6

4. Answer (06) ⇒ 7x +16y = 2

Let g denote the desired greatest common The solutions are of the form {x = 16k –2, y = –7k

divisor. Note that 20022 + 2 = 2002(2000 + 2) + 2 + 1}, where k takes on all integer values

= 2000(2002 + 2) + 6. By the Euclidean algorithm, 8. Answer (8)

we have Write the equation in ther form

gcd(2002 + 2, 20022 + 2) = gcd(2004, 6) = 6 x2y2 – 2xy + 1 + x2 + y2 – 2xy + 2(x – y)(1 – xy) =

Hence g|gcd(2002 + 2, 20022 + 2) = 6. On the 4

other hand, every number in the sequence 2002 Or (xy – 1)2 + (x – y)2 – 2(x – y)(xy – 1) = 4

+ 2, 20022 + 2, … is divisible by 2. Furthermore, This is equivalent to

since 2002 = 2001 + 1 = 667.3 + 1, for all positive [xy – 1 – (x – y)]2 = 4

Corporate Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Page [3]
IOQM (2024) Practice Sheet-1

Or (x + 1)(y – 1) = ±2 We obtain the equation


If (x + 1)(y – 1) = 2, we obtain the systems of [xy – 6 – (x + y)][xy – 6 + (x + y)] = –13
equations Yielding the systems
x  1  2, x  1  –2,  xy  6   x  y   1,  xy  6   x  y   13,
   
 y  1  1,  y  1  –1,  xy  6   x  y   13,  xy  6   x  y   1,
 x  1  1,  x  1  –1, These systems are equivalent to
 
y  1  2, y  1  –2, x  1  7, x  y  7,
 
Yielding the solutions (1, 2), (–3, 0), (0, 3), (–2, –  xy  12,  xy  0,
1) The solutions to the equation are (3, 4), (4, 3),
If (x + 1)(y – 1) = –2, we obtain the systems (0, 7), (7, 0).
 x  1  2, x  1  –2, 10. Answer (07)
 
y  1  –1,  y  1  1, The only primes are 2, 5, 5 – 2 = 3. Since p and
 x  1  1, x  1  –1, q = p + 3 one of them is even and the other is
 
y  1  –2,  y  1  2, odd, but the only even prime is 2.
Whose solutions are (1, 0), (–3, 2), (0, –1), (–2, p = 5 and q = 2
3). All eight pairs that we have found satisfy the 11. Answer (01)
given equation. By the Euclidean algorithm, we have
9. Answer (3, 4), (4, 3), (0, 7), (7, 0) gcd(n! + 1, (n + 1)! + 1)
The equations is equivalent to = gcd(n! + 1, (n + 1)! + 1 – (n + 1)(n! + 1))
(xy – 6)2 + 13 = (x + y)2 = gcd(n! + 1, n) = 1.
Or (xy – 6)2 – (x + y)2 = –13



Corporate Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Page [4]

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy