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 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.
Try this beautiful problem from Algebra based on Counting Days from AMC-10A (2013), Problem 17. You may use sequential hints to solve the problem.
Try this problem on periodic oscillation due to charge from NSEP 2015 Problem 12. You may use sequential hints to solve it.
This Workshop seeks to shed light on the various applications of the Number Theory concepts with the help of beautiful problems.
Try this beautiful Problem based on Mathematical Imagination from Math Kangaroo (Ecolier) 2010 Problem 16. You may use sequential hints to solve it.
Cheenta is delivering 2 live revision workshops on IOQM 2022. These sessions will be conducted by Shuborno Das, a Cheenta alumnus from Oxford University. You are invited to join the live session.
Try this beautiful Problem based on Ordering of fraction from AMC 8 2019 Problem 3. You may use sequential hints to solve it.
Try this beautiful Problem based on Number Counting from AMC 8 2019 Problem 1. You may use sequential hints to solve it.
Dr. Ashani Dasgupta is conducting a Training Session so as to guide the participats of the Bose Maths Olympiad Research Project Round.
If we know nothing about this world, we should know about cross ratio. It is one of those accidents of nature that is so unbelievable, unimaginable, that we need mathematics to accept it.
Try this beautiful interesting problem based on Number Theory from PRMO 2016 Problem 2. You may use sequential hints to solve it.
Try this problem on pulley problem on inclined plane from NSEP 2015 Problem 9. You may use sequential hints to solve it.