IOQM mock test Narayana 12th July

Q1. Two friends, Marco and Ian, are talking about their ages. Ian says, "My age is a zero of a polynomial with integer coefficients." Having seen the polynomial p(x) Ian was talking about, Marco exclaims,

"You mean, you are seven years old? Oops, sorry I miscalculated! p(7) = 77 and not zero."

"Yes, I am older than that," Ian's agreeing reply. Then Marco mentioned a certain number, but realizes after a while that he was wrong again because the value of the polynomial at that number is 85. Ian sighs, "I am even older than that number." Determine Ian's age.

S1.
Let the root be 'a'.
p(a) = 0
p(7) = 77
p(b) = 85 and b > 7.
a > b > 7.
For a polynomial with integer coefficients and x,y as integers:
x-y | p(x) - p(y)

So a-7 | p(a) - p(7)
a-7 | -77
So a-7 can be 1,7,11,77
=> a can be {8,14,18,84}

b - 7 | 8
=> b-7 can be 1,2,4,8
=> b can be {8,9,11,15}

a-b| 85
=> a-b can be 1,5,17,85

Only option which works is a = 14, b = 9
=> a = 14 = answer.

Q2. Find the number of triples of positive integers (m,p,q) such that

2^m.p^2 + 27 = q^3, and p is a prime.
S2.

3. The quadratic polynomial (f(x)) has a zero at (x=2). The polynomial (f(f(x))) has only one real zero, at (x=5). Compute


[

|18f(0)|.

]


---


4.  A rational number written in base eight is (\overline{ab.cd}), where all digits are nonzero. The same number in base twelve is (\overline{bb.ba}). Find


[

a+b+c.

]


---


5. Cut off a square carton by a straight line into two pieces, then cut one of two pieces into two small pieces by a straight line, etc. By cutting 2017 times we obtain 2018 pieces. We write number 2 in every triangle, number 1 in every quadrilateral, and 0 in the polygons. Is the sum of all inserted numbers always greater than 2017?

Comments

Post a Comment

Popular posts from this blog

Simon's factoring trick(complete the rectangle)

  "Complete the Rectangle" , also called Simon’s Favorite Factoring Trick , is a clever algebraic method for factoring expressions of the form: x y + a x + b y + c xy + ax + by + c Or more commonly, you'll see it used in a simpler form: x y + a x + b y + d xy + ax + by + d But especially when we’re given something like: x y + a x + b y + a b xy + ax + by + ab It becomes very easy to factor. Let me walk you through it step-by-step. 💡 The Key Idea We add and subtract a constant to turn the expression into a perfect rectangle (a.k.a. a factorable quadratic or product of binomials). The “complete the rectangle” version of this trick usually works best on expressions like: x y + a x + b y + a b xy + ax + by + ab We treat it like this: x y + a x + b y + a b = ( x + b ) ( y + a ) xy + ax + by + ab = (x + b)(y + a) ✅ Step-by-Step Example Factor: x y + 3 x + 2 y + 6 xy + 3x + 2y + 6 Step 1: Rearrange the terms: Group like this: x y + 3 x + 2 y + 6 xy + 3x + ...
Read more

IOQM 2024 Paper solutions (Done 1-21, 29)

Image
Q1 (number-theory). The smallest positive integer that does not divide 1 × 2 × 3 × 4 × 5 × 6 × 7 × 8 × 9 is: Solution : This product has all the integers from 1 to 9. So smallest integer not dividing it would be the next prime after 9. Which is 11. Answer: 11 Q2 (combinatorics): The number of four-digit odd numbers having digits 1, 2, 3, 4, each occurring exactly once, is: Solution: Last digit has to be 1 or 3: 2C1 Choosing remaining 3 digits: 3C3 Arranging those 3 digits: 3! Answer: 2C1*3C3*3! = 12 Q3 (number-theory): The number obtained by taking the last two digits of \(5^{2024}\) in the same order is: Solution: To get last 2 digits from number, divide by 100 and take the remainder. So we have to compute mod 100. 25 mod 100 = 25 25.5 mod 100 = 125 mod 100 = 25 5^3.5 mod 100 = 25.5 mod 100 = 25 5^4.5 mod 100 = 25.5 mod 100 = 25 ..... So: 5^2024 mod 100 = 25. Q4 (geometry): Let ABCD be a quadrilateral with \(\angle ADC = 70^\circ\), \(\angle ACD = 70^\circ\), \(\angle ACB = 10^\circ\...
Read more

IOQM 2023 solutions

Image
Q1. Let n be a positive integer such that 1 ≤ n ≤ 1000 . Let M n be the number of integers in the set X n = { 4 n + 1 , 4 n + 2 , … , 4 n + 1000 } . Let a = max ⁡ { M n : 1 ≤ n ≤ 1000 } , and b = min ⁡ { M n : 1 ≤ n ≤ 1000 } . a = \max\{M_n : 1 \leq n \leq 1000\}, \quad \text{and} \quad b = \min\{M_n : 1 \leq n \leq 1000\}. Find a − b a - b . Solution: Quick tip: If n^2 = k then (n+1)^2 = k + (2n + 1) We will use this here. Also as the numbers grow larger the gap between 2 perfect squares becomes less and less. For. e.g. there are 10 perfect squares between 1 and 100 but only 4 perfect squares between 101 and 200. So X1 = {sqrt(5) ... sqrt(1004)} will have the most number of perfect squares. While X1000 = {sqrt(4001)...sqrt(5000)} will have the least. In X1 the first integer square root is 3 and we know that 1024 is the square of 32 so the last integer will be 31. Total: 31 - 3 + 1 = 29 integers in X1. In X1000, We know that 64^2 = 4096 so 64 is the first integer. 70^2 = 4900 and ...
Read more