Cheenta Blog Since 2010

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 the solution of ISI-2013 undergraduate entrance

This is a nice problem based on Well-ordering principle , from ISI entrance 2013

Geometry problem from Iran math Olympiad .

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 beautiful problem from Algebra, based on Order Pair problem from AMC-10B, 2012. You may use sequential hints to solve the problem

Try this beautiful problem from Combinatorics based on Chosing Program from AMC-10A (2013), Problem 7. You may use sequential hints to solve the problem.

Try this beautiful problem from the Pre-RMO, 2017, Question 23, based on Solving Equation. You may use sequential hints to solve the problem.

Try this beautiful problem from the Pre-RMO, 2017, Question 23, based on Solving Equation. You may use sequential hints to solve the problem.

Try this beautiful problem from the Pre-RMO, 2017, Question 23, based on Solving Equation. You may use sequential hints to solve the problem.

Try this beautiful problem from the Pre-RMO II 2019, based on Missing Integers. You may use sequential hints to solve the problem.

Try this beautiful problem from Geometry: The area of triangle AMC-10, 2009. You may use sequential hints to solve the problem