Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2020 CIME I Problems/Problem 1

Revision as of 20:38, 30 August 2020 by Jbala (talk | contribs) (Created page with "==Problem 1== A knight begins on the point <math>(0,0)</math> in the coordinate plane. From any point <math>(x,y)</math> the knight moves to either <math>(x+2,y+1)</math> or <...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem 1

A knight begins on the point $(0,0)$ in the coordinate plane. From any point $(x,y)$ the knight moves to either $(x+2,y+1)$ or $(x+1,y+2)$. Find the number of ways the knight can reach the point $(15,15)$.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2020_CIME_I_Problems/Problem_1&oldid=132782"