Difference between revisions of "2023 IOQM Problems"

Latest revision as of 08:49, 1 October 2024

Problem 1

Let $n$ be a positive integer such that $1 \leq n \leq 1000$ . Let $M_n$ be the number of integers in the set

$X_n = \left\{\sqrt{4n + 1}, \sqrt{4n + 2}, \ldots, \sqrt{4n + 1000}\right\}$ . Let $a = \max\{M_n : 1 \leq n \leq 1000\}$ , and $b = \min\{M_n : 1 \leq n \leq 1000\}$ .

Find $a - b$ .

Solution

Video link containing all the solutions for this paper https://youtu.be/NXzyDJKbM1k?si=uUByYIteDqHY9-_L

Problem 2

Find the number of elements in the set

$\lbrace(a.b)\in N: 2 \leq a,b \leq2023,\:\: \log_{a}{b}+6\log_{b}{a}=5\rbrace$

Problem 3

Let $\alpha$ and $\beta$ be positive integers such that $\frac{16}{37}<\frac{\alpha}{\beta}<\frac{7}{16}$ Find the smallest possible value of $\beta$ .

Problem 4

Let $x, y$ be positive integers such that $x^{4}=(x-1)(y^{3}-23)-1$ Find the maximum possible value of $x + y$ .

Problem 5

In a triangle $ABC$ , let $E$ be the midpoint of $AC$ and $F$ be the midpoint of $AB$ . The medians $BE$ and $CF$ intersect at $G$ . Let $Y$ and $Z$ be the midpoints of $BE$ and $CF$ respectively. If the area of triangle $ABC$ is $480$ , find the area of triangle $GYZ$ .

Problem 6

Let $X$ be the set of all even positive integers $n$ such that the measure of the angle of some regular polygon is $n$ degrees. Find the number of elements in $X$ .

Problem 7

Unconventional dice are to be designed such that the six faces are marked with numbers from $1$ to $6$ with $1$ and $2$ appearing on opposite faces. Further, each face is colored either red or yellow with opposite faces always of the same color. Two dice are considered to have the same design if one of them can be rotated to obtain a dice that has the same numbers and colors on the corresponding faces as the other one. Find the number of distinct dice that can be designed.

Problem 8

Given a 2 x 2 tile and seven dominoes (2 x 1 tile), find the number of ways of tilling a 2 x 7 rectangle using some of these tiles.

Problem 9

Find the number of triples $(a, b, c)$ of positive integers such that (a) $ab$ is a prime;

(b) $bc$ is a product of two primes;

(c) $abc$ is not divisible by square of any prime and

(d) $abc\leq30$

Problem 10

The sequence $\{a_n\}_{n\geq0}$ is defined by $a_0 = 1$ , $a_1 = -4$ , and $a_{n+2} = -4a_{n+1} - 7a_n, \text{for } n \geq 0.$ Find the number of positive integer divisors of $a_{50}^2 - a_{49}a_{51}$ .

Problem 11

A positive integer $m$ haas the property that $m^2$ is expressible in the form $4n^2-5n+16$ , where n is an integer. Find the maximum value of $|m-n|$ .

Problem 13

The ex-radii of a triangle are 10 1/ 2, 12 and 14. If the sides of the triangle are the roots of the cubic $x^3-px^2+qx-r=0$ , where $p, q, r$ are integers, find the integer nearest to $\sqrt{p+q+r}$

Problem 15

Let $ABCD$ be a unit square. Suppose $M$ and $N$ are points on $BC$ and $CD$ respectively such that the perimeter of triangle $MCN$ is $2$ . Let $O$ be the circumcenter of triangle $MAN$ , and $P$ be the circumcenter of triangle $MON$ . If $\left(\dfrac{OP}{OA}\right)^2=\dfrac{m}{n}$ for some relatively prime positive integers $m$ and $n$ , find the value of $m+n$ .

Problem 16

Problem 17

Consider the set $S = \{ (a, b, c, d, e) : 0 < a < b < c < d < e < 100 \}$ where $a, b, c, d, e$ are integers. If $D$ is the average value of the fourth element of such a tuple in the set, taken over all the elements of S, find the largest integer less than or equal to D.

Problem 18

Let $P$ be a convex polygon with $50$ vertices. A set $F$ of diagonals of $P$ is said to be minimally friendly if any diagonal $d$ ∈ $F$ intersects at most one other diagonal in $F$ at a point interior to $P$ . Find the largest possible number of elements in a minimally friendly set $F$ .

Problem 19

For $n$ ∈ $N$ , let $P(n)$ denote the product of the digits in $n$ and $S(n)$ denote the sum of the digits in $n$ . Consider the set $A=\{n \in N : P(n) \text{is non-zero, square free and } S(n) \text{ is a proper divisor of } P(n) \}$ . Find the maximum possible number of digits of the numbers in $A$ .

Problem 20

For any finite non empty set $X$ of integers, let $\text{max} (X)$ denote the largest element of $X$ and $|X|$ denote the number of elements in $X$ . If $N$ is the number of ordered pairs $(A, B)$ of finite non-empty sets of positive integers, such that $\text{max} (A)$ × $|B|=12$ ; and $|A|$ × $\text{max} (B)=11$ and $N$ can be written as $100a + b$ where $a, b$ are positive integers less than $100$ , find $a + b$ .

Problem 21

For n ∈ N, consider non-negative integer valued function f on {1,2,...,n} satisfying $f(i)\ge f(j)$ for $i>j$ and $\sum_{i=1}^{n} i+f(i) = 2023$ . Choose n such that $\sum_{i=1}^{n}f(i)$ is the least. How many such functions exist in that case?

Problem 22

Problem 23

Problem 24

Problem 25

Problem 26

In the land of Binary, the unit of currency is called Ben and currency notes are available in denominations 1, 2, 2 2 , 2 3 , . . . Bens. The rules of the Government of Binary stipulate that one can not use more than two notes of any one denomination in any transaction. For example, one can give a change for 2 Bens in two ways: 2 one Ben notes or 1 two Ben note. For 5 Ben one can give 1 one Ben note and 1 four Ben note or 1 one Ben note and 2 two Ben notes. Using 5 one Ben notes or 3 one Ben notes and 1 two Ben notes for a 5 Ben transaction is prohibited. Find the number of ways in which one can give change for 100 Bens, following the rules of the Government.

Problem 27

Problem 28

On each side of an equilateral triangle with side length n units, where n is an integer, $1 \le n \le 100$ , consider $n-1$ points that divide the side into n equal segments. Through these points, draw lines parallel to the sides of the triangle, obtaining a net of equilateral triangles of side length one unit. On each of the vertices of these small triangles, place a coin head up. Two coins are said to be adjacent if the distance between them is 1 unit. A move consists of flipping over any three mutually adjacent coins. Find the number of values of n for which it is possible to turn all coins tail up after a finite number of moves.

Problem 29

A positive integer $n > 1$ is called $beautiful$ if $n$ can be written in one and only one way as $n = a_1 + a_2 +... + a_k = a_1 a_2 ... a_k$ for some positive integers $a_1, a_2, . . . , a_k$ , where $k > 1$ and $a_1 \geq a_2 \geq ... \geq a_k$ . (For example 6 is beautiful since 6 = 3 · 2 · 1 = 3 + 2 + 1 , and this is unique. But 8 is not beautiful since 8 = 4 + 2 + 1 + 1 = 4 · 2 · 1 · 1 as well as 8 = 2 + 2 + 2 + 1 + 1 = 2 · 2 · 2 · 1 · 1 , so uniqueness is lost.) Find the largest beautiful number less than 100.

Problem 30

Let $d(m)$ denote the number of positive integer divisors of a positive integer $m$ . If $r$ is the no of integers $n \leq 2023$ for which $\sum_{i = 1}^{n} d(i)$ is odd, find the sum of the digits of $r$ .

@@ Line 6: / Line 6: @@
 Find <math>a - b</math>.
+== Solution ==
+Video link containing all the solutions for this paper https://youtu.be/NXzyDJKbM1k?si=uUByYIteDqHY9-_L
 ==Problem 2==
@@ Line 13: / Line 16: @@
 ==Problem 3==
-Let α and β be positive integers such that<cmath>\frac{16}{37}<\frac{\alpha}{\beta}<\frac{7}{16}</cmath>Find the smallest possible value of β .
+Let <math>\alpha</math> and <math>\beta</math> be positive integers such that<cmath>\frac{16}{37}<\frac{\alpha}{\beta}<\frac{7}{16}</cmath>Find the smallest possible value of <math>\beta</math>.
 ==Problem 4==
 Let <math>x, y</math> be positive integers such that<cmath>x^{4}=(x-1)(y^{3}-23)-1</cmath>
 Find the maximum possible value of <math>x + y</math>.
 ==Problem 5==
+In a triangle <math>ABC</math>, let <math>E</math> be the midpoint of <math>AC</math> and <math>F</math> be the midpoint of <math>AB</math>.
+The medians <math>BE</math> and <math>CF</math> intersect at <math>G</math>. Let <math>Y</math> and <math>Z</math> be the midpoints of <math>BE</math>
+and <math>CF</math> respectively. If the area of triangle <math>ABC</math> is <math>480</math>, find the area of triangle <math>GYZ</math>.
 ==Problem 6==
+Let <math>X</math> be the set of all even positive integers <math>n</math> such that the measure of the angle of some regular polygon is <math>n</math> degrees. Find the number of elements in <math>X</math>.
 ==Problem 7==
+Unconventional dice are to be designed such that the six faces are marked with numbers from <math>1</math> to <math>6</math> with <math>1</math> and <math>2</math> appearing on opposite faces. Further, each face is colored either red or yellow with opposite faces always of the same color. Two dice are considered to have the same design if one of them can be rotated to obtain a dice that has the same numbers and colors on the corresponding faces as the other one. Find the number of distinct dice that can be designed.
 ==Problem 8==
+Given a 2 x 2 tile and seven dominoes (2 x 1 tile), find the number of ways of tilling a 2 x 7 rectangle using some of these tiles.
 ==Problem 9==
-Find the number of triples <math>(a, b, c)</math> of positive integers such that (a) <math>ab</math> is a prime;
+Find the number of triples <math>(a, b, c)</math> of positive integers such that
+(a) <math>ab</math> is a prime;
 (b) <math>bc</math> is a product of two primes;
@@ Line 32: / Line 45: @@
 The sequence <math>\{a_n\}_{n\geq0}</math> is defined by <math>a_0 = 1</math>, <math>a_1 = -4</math>, and <math>a_{n+2} = -4a_{n+1} - 7a_n, \text{for } n \geq 0.</math> Find the number of positive integer divisors of <math>a_{50}^2 - a_{49}a_{51}</math>.
 ==Problem 11==
-==Problem 12==
+A positive integer <math>m</math> haas the property that <math>m^2</math> is expressible in the form <math>4n^2-5n+16</math>, where n is an integer. Find the maximum value of <math>|m-n|</math>.
 ==Problem 13==
-The ex-radii of a triangle are 10 1 2 , 12 and 14. If the sides of the triangle are the roots of the cubic <math>x^3-px^2+qx-r=0</math> , where <math>p, q, r</math> are integers, find the integer nearest to <math>\sqrt{p+q+r}</math>
+The ex-radii of a triangle are 10 1/ 2, 12 and 14. If the sides of the triangle are the roots of the cubic <math>x^3-px^2+qx-r=0</math> , where <math>p, q, r</math> are integers, find the integer nearest to <math>\sqrt{p+q+r}</math>
-==Problem 14==
 ==Problem 15==
+Let <math>ABCD</math> be a unit square. Suppose <math>M</math> and <math>N</math> are points on <math>BC</math> and <math>CD</math> respectively such that the perimeter of triangle <math>MCN</math> is <math>2</math>. Let <math>O</math> be the circumcenter of triangle <math>MAN</math>, and <math>P</math> be the circumcenter of triangle <math>MON</math>. If <math>\left(\dfrac{OP}{OA}\right)^2=\dfrac{m}{n}</math> for some relatively prime positive integers <math>m</math> and <math>n</math>, find the value of <math>m+n</math>.
 ==Problem 16==
 ==Problem 17==
@@ Line 44: / Line 59: @@
 Let <math>P</math> be a convex polygon with <math>50</math> vertices. A set <math>F</math> of diagonals of <math>P</math> is said to be minimally friendly if any diagonal <math>d</math> ∈ <math>F</math> intersects at most one other diagonal in <math>F</math> at a point interior to <math>P</math> . Find the largest possible number of elements in a minimally friendly set <math>F</math>.
 ==Problem 19==
-For <math>n</math> ∈ <math>N</math> , let <math>P(n)</math> denote the product of the digits in <math>n</math> and <math>S(n)</math> denote the sum of the digits in <math>n</math> . Consider the set <math>A={n</math>∈<math> N : P(n) \text{is non-zero, square free and }S(n) \text{ is a proper divisor of } P(n) }</math> . Find the maximum possible number of digits of the numbers in <math>A</math> .
+For <math>n</math> ∈ <math>N</math> , let <math>P(n)</math> denote the product of the digits in <math>n</math> and <math>S(n)</math> denote the sum of the digits in <math>n</math> . Consider the set <math>A=\{n \in N : P(n) \text{is non-zero, square free and } S(n) \text{ is a proper divisor of } P(n) \}</math> . Find the maximum possible number of digits of the numbers in <math>A</math> .
 ==Problem 20==
 For any finite non empty set <math>X</math> of integers, let <math>\text{max} (X)</math> denote the largest element of <math>X</math> and <math>|X|</math> denote the number of elements in <math>X</math> . If <math>N</math> is the number of ordered pairs <math>(A, B)</math> of finite non-empty sets of positive integers, such that <math>\text{max} (A)</math> × <math>|B|=12</math>; and <math>|A|</math> × <math>\text{max} (B)=11</math> and <math>N</math> can be written as <math>100a + b</math> where <math>a, b</math> are positive integers less than <math>100</math>, find <math>a + b</math> .
 ==Problem 21==
-For <math>n</math> ∈ <math>N</math> , consider non-negative integer-valued functions <math>f</math> on <math>{1, 2, . . . , n}</math> satisfying <math>f(i) ≥ f(j)</math> for <math>i > j</math> and <math>P_n i=1 (i + f(i))=2023</math> . Choose <math>n</math> such that <math>P_n i=1 f(i)</math> is the least. How many such functions exist in that case?
+For n ∈ N, consider non-negative integer valued function f on {1,2,...,n} satisfying <math>f(i)\ge f(j)</math> for <math>i>j</math> and <math>\sum_{i=1}^{n} i+f(i) = 2023</math>. Choose n such that <math>\sum_{i=1}^{n}f(i)</math> is the least. How many such functions exist in that case?
 ==Problem 22==
 ==Problem 23==
@@ Line 58: / Line 73: @@
 ==Problem 27==
 ==Problem 28==
-On each side of an equilateral triangle with side length n units, where n is an integer, <math>1</math> ≤ <math>n</math> ≤ <math>100</math> , consider <math>n − 1</math> points that divide the side into n equal segments. Through these points, draw lines parallel to the sides of the triangle, obtaining a net of equilateral triangles of side length one unit. On each of the vertices of these small triangles, place a coin head up. Two coins are said to be adjacent if the distance between them is 1 unit. A move consists of flipping over any three mutually adjacent coins. Find the number of values of n for which it is possible to turn all coins tail up after a finite number of moves.
+On each side of an equilateral triangle with side length n units, where n is an integer, <math>1 \le n \le 100</math> , consider <math>n-1</math> points that divide the side into n equal segments. Through these points, draw lines parallel to the sides of the triangle, obtaining a net of equilateral triangles of side length one unit. On each of the vertices of these small triangles, place a coin head up. Two coins are said to be adjacent if the distance between them is 1 unit. A move consists of flipping over any three mutually adjacent coins. Find the number of values of n for which it is possible to turn all coins tail up after a finite number of moves.
 ==Problem 29==
 A positive integer <math>n > 1</math> is called <math>beautiful</math> if <math>n</math> can be written in one and only one way as <math>n = a_1 + a_2 +... + a_k = a_1 a_2 ... a_k</math> for some positive integers <math>a_1, a_2, . . . , a_k</math> , where <math>k > 1</math> and <math>a_1 \geq a_2 \geq ... \geq a_k</math> . (For example 6 is beautiful since 6 = 3 · 2 · 1 = 3 + 2 + 1 , and this is unique. But 8 is not beautiful since 8 = 4 + 2 + 1 + 1 = 4 · 2 · 1 · 1 as well as 8 = 2 + 2 + 2 + 1 + 1 = 2 · 2 · 2 · 1 · 1 , so uniqueness is lost.) Find the largest beautiful number less than 100.
 ==Problem 30==
+Let <math>d(m)</math> denote the number of positive integer divisors of a positive integer <math>m</math>. If <math>r</math> is the no of integers <math>n \leq 2023</math> for which <math>\sum_{i = 1}^{n} d(i)</math> is odd, find the sum of the digits of <math>r</math>.

Page

Toolbox

Search