Difference between revisions of "Chittur Gopalakrishnavishwanathasrinivasaiyer Lemma"
m (added deletion request) |
|||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | We know that an <math>x</math> exists that equal to <math>\text{ | + | 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 coaches Iyer Sir and Barnes approved this nice lemma. |
| + | {{delete|false theorem}} | ||
Latest revision as of 20:21, 7 October 2024
We know that anexists that equal to
This
where
is the number of composite factors the radius has. This theorem is also used in Newton's Sums, as the
Finally, you'll se it in combo! The number ways you can shuffle
items where
is the number of partitions in an item is the
My coaches Iyer Sir and Barnes approved this nice lemma.
exists that equal to 
This 
where 
is the number of composite factors the radius has. This theorem is also used in Newton's Sums, as the 
Finally, you'll se it in combo! The number ways you can shuffle 
items where 
is the number of partitions in an item is the 
My coaches Iyer Sir and Barnes approved this nice lemma.
| This article has been proposed for deletion. The reason given is: false theorem.
Sysops: Before deleting this article, please check the article discussion pages and history. |
