Try this beautiful problem from AMC 8. It involves the concept of a variable, binary operation and ratio-proportion. We provide sequential hints so that you can try the problem.
Try this beautiful problem from AMC 8. It involves the concept of a variable, binary operation and ratio-proportion. We provide sequential hints so that you can try the problem.
Try this beautiful problem from AMC 10A. It involves arrangment of numbers out of which some elements are similar. We provide sequential hints so that you can try the problem.
Try this beautiful problem of probability is based upon tossing the coin and finding probability from AMC 10B 2019. You may use sequential hints to help you solve the problem.
Try this beautiful problem from AMC 8. It involves the concept of divisibility. We provide sequential hints so that you can try the problem.
Euclidean algorithm is used to find GCD (greatest common divisor). Use tutorial video and practise problems to master this tool.
Try these AMC 8 Number Theory Questions and check your knowledge! AMC 8, 2025, Problem 2 The table below shows the ancient Egyptian hieroglyphs that were used to represent different numbers. For example, the number 32 was represented by $\cap \cap \cap|\mid$. What number was represented by the following combination of hieroglyphs? (A) 1,423(B) 10,423(C) […]
Try these AMC 8 Combinatorics Questions and check your knowledge! AMC 8, 2025, Problem 5 Betty drives a truck to deliver packages in a neighborhood whose street map is shown below. Betty starts at the factory (labeled $F$ ) and drives to location $A$, then $B$, then $C$, before returning to $F$. What is the […]
Try this beautiful problem from AMC 8. It involves permutation and basic counting principles. We provide sequential hints so that you can try the problem.
Try this beautiful problem from AMC 10. It involves geometry of triangles. We provide sequential hints so that you can try the problem.
Try this beautiful problem from AMC 8. It involves basic agebra and powers of numbers. We provide sequential hints so that you can try the problem.
Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1987 based on Distance and Spheres.
Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2015 based on Arithmetic Mean. You may use sequential hints.
Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2012 based on Distance Time. You may use sequential hints.
This is our 2nd post on Cheenta Probability series, where we discuss mainly with two gambling problems, solved collaboratively by two great mathematcians Blaise Pascal and Pierre de Fermat, who ended up defining the idea of fairness of a game.
This blog series is aimed towards Undergraduates in Statistics who want to savour probability theory in a different form altogether. We are pretty curious to collaborate and interact with probability theory enthusiasts. It would be great if they enlighten us with their insights too.
Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2000 based on Algebra and Combination.
Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2000 based on Algebraic Equation.
This is a very beautiful sample problem from ISI MStat PSB 2014 Problem 1 based on Vector space and Eigen values and Eigen vectors . Let's give it a try !!
Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2000 based on Sequence and fraction.
Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2000 based on Arithmetic and geometric mean with Algebra.