1 November 2023

• 10:4810:48, 1 November 2023 diff hist +2 2023 INMO Problems/Problem 1 →SOLUTION

27 October 2023

• 09:0909:09, 27 October 2023 diff hist −112 2023 AIME I Problems/Problem 2 →Problem
• 00:0700:07, 27 October 2023 diff hist −252 2023 AIME I Problems/Problem 2 →Problem
• 00:0700:07, 27 October 2023 diff hist +3 2023 AIME I Problems/Problem 2 →Problem
• 00:0500:05, 27 October 2023 diff hist +669 N 2023 IOQM/Problem 26 Created page with ". 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 Bina..." current
• 00:0400:04, 27 October 2023 diff hist +164 N 2023 IOQM/Problem 10 Created page with "The sequence hanin≥0 is defined by a0 = 1, a1 = −4 and an+2 = −4an+1 − 7an , for n ≥ 0 . Find the number of positive integer divisors of a 2 50 − a49a51"
• 00:0400:04, 27 October 2023 diff hist +205 N 2023 IOQM/Problem 13 Created page with "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 − px2 + qx − r = 0 , where p, q, r are integers, find the in..."
• 00:0300:03, 27 October 2023 diff hist +238 N 2023 IOQM/Problem 21 Created page with "For n ∈ N , consider non-negative integer-valued functions f on {1, 2, . . . , n} satisfying f(i) ≥ f(j) for i > j and Pn i=1 (i + f(i)) = 2023 . Choose n such that Pn i=1..." current
• 00:0300:03, 27 October 2023 diff hist +640 N 2023 IOQM/Problem 28 Created page with "On each side of an equilateral triangle with side length n units, where n is an integer, 1 ≤ n ≤ 100 , consider n − 1 points that divide the side into n equal segments...." current
• 00:0200:02, 27 October 2023 diff hist +368 N 2023 IOQM/Problem 20 Created page with "For any finite non empty set X of integers, let 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)..." current
• 00:0200:02, 27 October 2023 diff hist +273 N 2023 IOQM/Problem 19 Created page with "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 ∈ N : P(n) is non-zero, square free and S(n..." current
• 00:0100:01, 27 October 2023 diff hist +271 N 2023 IOQM/Problem 18 Created page with "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..." current