olymmath

HMMT 2012 C4

  • Combinatorics
  • Answer

A frog is at the point (0,0)(0,0). Every second, he can jump one unit either up or right. He can only move to points (x,y)(x, y) where xx and yy are not both odd. How many ways can he get to the point (8,14)(8,14) ?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

330

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2012/c4 · Tag M8X3VES592 · Edit this page on GitHub · Keys: j next, k previous