Bilal and Ahmed play the following game with n sticks on a…

Bilal and Ahmed play the following game with n sticks on a table. Each must remove 1,2,3,4, or 5 sticks at a time on alternate turns, and no stick that is removed is put back on the table. The one who removes the last stick (or sticks) from the table wins. If Bilal goes first, which of the following is a value of n such that Ahmed can always win no matter how Bilal plays?

AQuA-RAT — Algebra Question Answering with Rationales (Ling et al., DeepMind, 2017) · train #43869