The inverse of a number (modulo some specific integer) is inherently related to GCD (Greatest Common Divisor). Euclidean Algorithm and Bezout's Theorem forms the bridge between these ideas. We explore these beautiful ideas.
The inverse of a number (modulo some specific integer) is inherently related to GCD (Greatest Common Divisor). Euclidean Algorithm and Bezout's Theorem forms the bridge between these ideas. We explore these beautiful ideas.
Invariance is a fundamental phenomenon in mathematics. In this combinatorics problem from ISI Entrance, we discuss how to use invariance.
This is a nice problem based on Well-ordering principle , from ISI entrance 2013
Try this beautiful Problem on Fraction from Algebra from AMC 10A, 2015. You may use sequential hints to solve the problem.
Try this beautiful Pen & Note Books Problem from Algebra from PRMO 2017, Question 8. You may use sequential hints to solve the problem.
Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 1996, Question 2, based on Greatest Positive Integer.
Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1993 based on Integers. Use sequential hints if required.
Try this beautiful problem from the PRMO II, 2019 based on the Sum of Digits base 10. You may use sequential hints to solve the problem.
Try this beautiful problem from the PRMO II, 2019, Question 26, based on Distance travelled. You may use sequential hints to solve the problem.
Try this beautiful Problem based on Chords in a Circle, Geometry from PRMO 2017, Question 26. You may use sequential hints to solve the problem.
Try this beautiful Problem from Geometry based on Circle from PRMO 2017, Question 27. You may use sequential hints to solve the problem.
Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1992 based on Digits and Rationals.
Try this beautiful problem from Geometry: Side of Square from AMC-10A (2013) Problem 3. You may use sequential hints to solve the problem.
Lakhs of students participated in IOQM, the first level of real mathematical olympiads in India. Only 628 are in the top. At least 6 out them are from Cheenta.
We discuss how to appreciate the beauty of mathematics and how to communicate the same to children using experiments and pattern recognition.
In the Thanksgiving break, 2022, join Cheenta for an outstanding Geometry workshop for Math Olympiads. In this online workshop students will explore the beauty of geometric thinking and problem solving. Trainer: Dr. Ashani DasguptaPhD in Mathematics from University of Wisconsin-MilwaukeeMath Olympiad coach at Cheenta since 2010 For high school (Grades 9 to 12) Thursday - […]
Understand how Cheenta Math Circles are critical for training students for math olympiads and other advanced mathematical competitions.
Problems, solutions and discussion on IOQM 2022 (India).
Imagine sharpening your sword with a whetstone. The job of the stone is to sharpen the sword. It does not matter what color the stone is. Cheenta programs are designed like whetstones. They are supposed to sharpen the creativity and problem solving skills through a slow but sure process. They involve thousands of thought provoking […]
This Workshop seeks to shed light on the various applications of the Power of the Point with the help of beautiful problems.
How Siva S, a student from Cheenta got into Purdue University to pursue Ph.D. in Mathematics? Learn from Siva's Success Story.
Try this beautiful Combination Problem based on Non-negative integer solutions from PRMO 2016 Problem 4. You may use sequential hints to solve it.
Try this beautiful Set theory Problem based on Set theory from PRMO 2016. You may use sequential hints to solve it.