Posts

INMO PS 18 Nov pending

Image
 Q1. S1. cyc below sigma simply means replace b->c a->b and then again c->a b->c To utilize abc = 1 Assume a = x/y, b = y/z, c = z/x It is always valid since we can take x = a, y =1, z = 1/b In fact (at, t, t/b) is a general solution. Now we have cyclic denominators and they are positive as well. So Titu's lemma might help. Trying out gives: which is not very helpful. So let's try our x,y,z substitution and try to make squares out of numerators. Now our problem becomes: Using AM/GM: and then: Now: Now multiply by x^2, y^2, z^2 up and down to make the fractions usable for Titu's lemma: Now try to convert remaining terms to P^2 using Rearrangement inequality: H.P.

Pell's fundamental solution theorem

Pell equation: x^2 - Dy^2 = 1 where D is a positive integer which is not a perfect square. x,y are positive integers. Pell's fundamental solution theorem statement: 1. There exist a fundamental solution (x1,y1) satisfying the equation which corresponds to smallest such x1 and hence smallest such y1. 2. It has infinite solutions of the form: xn + sqrt(D).yn = (x1 + sqrt(D).y1)^n for n >= 1 From the binomial expansion of RHS it's clear that y1 | yn for all n >= 1. Example: x^2 - 2y^2 = 1 x^2 = 2y^2 + 1 try y = 1, no y = 2 x = 3 yes General solution: xn + sqrt(2).yn = (3+2.sqrt(2))^n

rmo aakash lecture 2 pending Q2,Q3

Image
Q1. S1. 4 = -3 mod 7 5 = -2 mod 7 9 = 2 mod 7 And 7 | 98 So for each odd p 7 | f(p) => for each p>=3. For p = 2, f(2) = 9 + 16 + 25 + 81 - 98 = 131-98 = 33 = 3*11 So f(2) has 4 divisors. Similarly 3^1 = 3 mod 11 3^2 = 9 mod 11 3^3 = 5 mod 11 3^4 = 4 mod 11 3^5 = 1 mod 11 So powers of 3 start cycling from exponent 5 onwards mod 11. So 9 = 3^2, 5 = 3^3 4 = 3^4 Basically f(p) = 3^p + 3^4p + 3^3p + 3^2p +1 mod 11 p,2p,3p,4p will give remainders 1,2,3,4 in some order modulo 5 as long as p is not 5. So f(p) = 3 + 9 + 4 + 5 + 1 mod 11 always for p != 5 f(p) = 22 mod 11 = 0 mod 11 for each prime p != 5 So 77 | f(p) for each prime p != 2,5 So 4 divisors are guaranteed for each prime p. And f(p) = 7^a.11^b Cases for (a,b) (1,1)(2,1)(1,2) which will give 4,6,6 divisors. And f(p) = 77,539,847 because any higher power of 7 or 11 will raise divisor count > 6. f(3) = 847 So 77,539 are not possible. And hence any f(p) above 3(except 5 which is yet to be checked) is not possible since that wou...

rmo mock test 2 pan

Image
 

Html Chessboard 10x10 with c-r mod 10

10 × 10 Chessboard: (row, column, (column − row) mod 10) 10 × 10 chessboard: (r, c, (c − r) mod 10) Each square shows its row, column on the first line and its remainder on the second. For example, row 1, column 1 has remainder 0, so its label is 1,1,0 . Highlight remainder group: All groups Show all squares Showing all 100 squares. Tip: click any square to highlight its 10-square group. All squares in a highlighted group lie in different rows and columns. Negative differences: the remainder is computed as ((c - r) % 10 + 10) % 10 . So square (9, 1) has c − r = −8 , giving remainder 2 .

combinatorics lecture 2 rmo done

Image
 Q1. S1. First think if a regular pentagon. If you choose any 3 of its vertices they will form an isosceles triangle. Why? Let's say it is ABCDE. Let's say you pick any side like AB or AD. Its distance of any vertex is either the length side of the pentagon or its diagonal length. In any triangle made up of 3 vertices of a pentagon  - by PHP 2 of its sides will have equal length. So it's guaranteed to be isosceles whenever we pick 3 vertices from a pentagon to make a triangle. Now from the regular 20-gon let's group the vertices so that they form regular pentagons: {1,5,9,13,17} {2,6,10,14,18} {3,7,11,15,19} {4,8,12,16,20} We have 17 vertices which are blue or green. WLOG at least 9 are blue. At least 3 of them will fall in one pentagon group above. And they will make an isosceles triangle. H.P. Q2. S2. Try 3x3 You have to place 7 rooks and show that there will be 3 rooks which won't attack each other. Explore the 10x10  chessboard . Group the rooks by c-r mod 10 Fo...