Two fair dice are thrown and the product of the two numbers on the top faces is computed. Let \({{R}_{n}}\) be the remainder when the product is divided by \(n\).
The two dice are thrown m times and the product of the two numbers on the top faces are computed each time. \(X\) is the number of products that are divisible by \(6\) after \(m\) throws.
Video solution locked
A free account saves your progress; this video needs a course plan.
680+ questions here come with free worked solutions. A free account saves your questions and progress; this one needs a course plan.
Create a free account to practise similar questions.
Need help? Join our JC Math tuition classes.
Learn more