Mock CIMC 2023 Part A - Question 6

All Submissions
Best Submissions

Difficulty: 4

This problem is tagged with cimc, mockcimc23, highschool.

In a video game, a character can move only up or to the right on a grid. The character starts at the origin $(0, 0)$ and wants to reach the point $(7, 9)$ on the grid. How many different paths can the character take to reach the destination, given that the character can only move in the up or right direction at each step?

Please login or sign up to submit and check if your answer is correct.

Advertisement


flag Report Content
You should report content if:
  • It may be offensive.
  • There is something wrong with it (statement or difficulty value)
  • It isn't original.
Thanks for keeping the Math Contest Repository a clean and safe environment!