Difference between revisions of "Chittur Gopalakrishnavishwanathasrinivasaiyer Lemma"

Line 1: Line 1:
  We know that an <math>x</math> exists that equal to <math>\text{42*10 mod (\sqrt{4761}.</math> This <math>x</math> is very powerful in competition math problems. Usually coming up on JMO and AMO geo problems. The Euler Line intersects the radical axis at <math>(x^n, n^x)</math> where <math>n</math> is the number of composite factors the radius has. This theorem is also used in Newton's Sums, as the <math>n</math>th root unity is the same thing as <math>x^n</math> <math>\text{mod}</math> <math>(42*10\cdot(70-1)^n).</math> Finally, you'll se it in combo! The number ways you can shuffle <math>n</math> things into <math>n^2 + nk + 1</math> items where <math>k</math> is the number of partitions in an item is the <math>x^{23\cdot3}.</math> My coach Iyer Sir approved this nice lemma.
+
  We know that an <math>x</math> exists that equal to <math>42\, \cdot</math> <math>\text{mod} \sqrt{4761}.</math> This <math>x</math> is very powerful in competition math problems. Usually coming up on JMO and AMO geo problems. The Euler Line intersects the radical axis at <math>(x^n, n^x)</math> where <math>n</math> is the number of composite factors the radius has. This theorem is also used in Newton's Sums, as the <math>n</math>th root unity is the same thing as <math>x^n</math> <math>\text{mod}</math> <math>(42*10\cdot(70-1)^n).</math> Finally, you'll se it in combo! The number ways you can shuffle <math>n</math> things into <math>n^2 + nk + 1</math> items where <math>k</math> is the number of partitions in an item is the <math>x^{23\cdot3}.</math> My coach Iyer Sir approved this nice lemma.

Revision as of 21:29, 30 April 2021

We know that an $x$ exists that equal to $42\, \cdot$ $\text{mod} \sqrt{4761}.$ This $x$ is very powerful in competition math problems. Usually coming up on JMO and AMO geo problems. The Euler Line intersects the radical axis at $(x^n, n^x)$ where $n$ is the number of composite factors the radius has. This theorem is also used in Newton's Sums, as the $n$th root unity is the same thing as $x^n$ $\text{mod}$ $(42*10\cdot(70-1)^n).$ Finally, you'll se it in combo! The number ways you can shuffle $n$ things into $n^2 + nk + 1$ items where $k$ is the number of partitions in an item is the $x^{23\cdot3}.$ My coach Iyer Sir approved this nice lemma.
Invalid username
Login to AoPS