Lemma
MediumAlgebra word problems
AQuA-RAT train #41313 · Algebra · Algebra word problems

The number of ways in which ten candidates A1, A2, ...., A10…

The number of ways in which ten candidates A1, A2, ...., A10 can be ranked so that A1 is always above A2 is

~8 minAnswer checked instantly

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

Stuck? A gentle nudge

No hints for this one.

Something off?
Workspace
Your answer

Checked against the answer in AQuA-RAT.