AQuA-RAT train #79737 · Number Theory · Divisibility
There are 9 cities numbered 1 to 9.From how many cities the…
There are 9 cities numbered 1 to 9.From how many cities the flight can start so as to reach the city 8 either directly or indirectly such that the path formed is divisible by 3.
AQuA-RAT — Algebra Question Answering with Rationales (Ling et al., DeepMind, 2017) · train #79737
Stuck? A gentle nudge
No hints for this one.
Your answer
Checked against the answer in AQuA-RAT.