benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / A frog is at the point (0,0). Every second, he can jump one unit either up or right. He can only move to points (x,y) where x and y are not both odd. How many ways can he get to th…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

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)?
Plain-text mathematical notation (without MathML)
A frog is at the point (0,0). Every second, he can jump one unit either up or right. He can only move to points (x,y) where x and y are not both odd. How many ways can he get to the point (8,14)?
Original LaTeX notation
A frog is at the point $(0,0)$. Every second, he can jump one unit either up or right. He can only move to points $(x, y)$ where $x$ and $y$ are not both odd. How many ways can he get to the point $(8,14)$?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
a3fcefa0-102d-519f-a150-b1d1bbc82f77
task_key
test--a3fcefa0-102d-519f-a150-b1d1bbc82f77
task_revision_id
1
config / split
/ test

Official source

initial import