Try this beautiful problem from Number theory based on divisibility from AMC-10A, 2003. You may use sequential hints to solve the problem.
Try this beautiful problem from Number theory based on divisibility from AMC-10A, 2003. You may use sequential hints to solve the problem.
Try this beautiful problem from Inequation from TOMATO useful for ISI B.Stat Entrance based on condition checking.You may use sequential hints.
This problem is called the Elchanan Mossel's Dice Paradox. The problem has a paradoxical nature, but there is always a way out. This ISI MStat 2018 PSB Problem 6.
Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2011 based on Rectangles and sides.
Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1999 based on Function of Complex numbers.
Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1999 based on Squares and Triangles.
Try this TOMATO problem from I.S.I. B.Stat Entrance Objective Problem based on Logic True-False Reasoning. You may use sequential hints.
This problem is a beautiful and simple application of bijection principle to count how we can select the number of non consecutive integers in combinatorics from Problem 3 of ISI MStat 2019 PSB.
This is an interesting problem from conditional probability and bernoulli random variable mixture, which gives a sweet and sour taste to the Problem 4 of ISI MStat 2016 PSB.
Try this beautiful problem from the Pre-RMO, 2019 based on Triangle and Integer. You may use sequential hints to solve the problem.