A 2026×2026 board is said to be bordeaux if at least one of its 20262 unit cells is coloured red. A rectangular region made of cells is oddly-rectangular if it contains an odd number of red cells. Determine the largest positive integer M such that, in every possible 2026×2026 bordeaux board, there exists an oddly-rectangular region of at least M cells.
Note: A rectangular region has sides that are parallel to the sides of the board and contains all of its interior.
Given a positive integer n, Marie plays a game where she starts with the number 1 on a blackboard. As many times as she wants, she can choose an integer j such that 1≤j≤n and replace the number V on the blackboard with the number j⋅R(jV). Here, R(x) denotes the nearest integer to x; if x is exactly halfway between two consecutive integers, it is rounded up. For example, R(1.3)=1 and R(1.5)=R(1.8)=2.
a) Prove that for each given n, there is a positive integer B such that Marie can never end up with a number larger than B on the blackboard.
b) For any given n, let f(n) be the maximum number obtainable on the blackboard after finitely many replacements. Show that there exists a positive integer N such that for all n≥N, we have that 2026 divides f(n).
Let ABC be an acute triangle with AC>AB. Denote by ω its circumcircle and by O its circumcentre. Let K be the intersection of the tangents to ω at B and C. Circle ABK intersects line BC again at Z=B. Let L be the midpoint of KZ. Let X be the intersection of lines KZ and AB. Let V be the point on circle ABL on the same side of BC as A such that OV is perpendicular to KZ. Prove that LV is perpendicular to CX.
Let p be a prime number and let n be a positive integer such that p does not divide n. Denote by k the number of positive divisors of n, and by 1=d1<d2<⋯<dk=n the positive divisors of n. For i=1,2,…,k, let ci be the number of positive divisors ℓ of di2 such that di−ℓ is divisible by p. Prove that