Feynman Checkerboard!

Discrete Mathematics Level 4

Richard P Feynman starts his journey from \(O=(0,0)\) towards \(A=(10,6).\) He can only go in the \(+x\) and \(+y\) directions along the lattice, and he must turn exactly 7 times. An example path is shown above, with the yellow dots indicating turns.

How many ways can Feynman travel from \(O\) to \(A\) in this way?

Bonus: Consider the general case, traveling from \((0,0)\) to \((p,q)\) with exactly \(r\) turns.

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, interactive explorations.

Used and loved by over 7 million people

Learn from a vibrant community of students and enthusiasts, including olympiad champions, researchers, and professionals.