Consider the following set of numbers:
$ \displaystyle {M = \{ \frac{1}{1}, \frac{1}{2}, \frac{1}{3}, ... \} }$
Does this set have a least number? Can you rigorously prove your answer?
Concepts in this lesson will help you to answer this question and more.
The well-ordering principle states that every non-empty set of positive integers contains a least element.
Counter Example: The set of rational numbers does not have this property
Bezout Theorem: Let a and b be integers with the greatest common divisor d. Then, there exist integers x and y such that ax + by = d. More generally, the integers of the form ax + by are exactly the multiples of d.
In 2025, 8 students from Cheenta Academy cracked the prestigious Regional Math Olympiad. In this post, we will share some of their success stories and learning strategies. The Regional Mathematics Olympiad (RMO) and the Indian National Mathematics Olympiad (INMO) are two most important mathematics contests in India.These two contests are for the students who are […]
Cheenta Academy proudly celebrates the success of 27 current and former students who qualified for the Indian Olympiad Qualifier in Mathematics (IOQM) 2025, advancing to the next stage — RMO. This accomplishment highlights their perseverance and Cheenta’s ongoing mission to nurture mathematical excellence and research-oriented learning.
Cheenta students shine at the Purple Comet Math Meet 2025 organized by Titu Andreescu and Jonathan Kanewith top national and global ranks.
Celebrate the success of Cheenta students in the Stanford Math Tournament. The Unified Vectors team achieved Top 20 in the Team Round.
