10 questions · need 7/10 to pass.
Q1.Which statement about how "Prime numbers and composite numbers" actually works is correct?
single
Q2."Least common multiple" — which of these claims is supported by the module?
single
Q3.When applying "Integer representations and bases" in practice, which of these holds?
single
Q4.When applying "The Euclidean algorithm" in practice, which of these holds?
single
Q5.For "The fundamental theorem of arithmetic", which detail or constraint from the module is accurate?
single
Q6.Which of these correctly identifies the role of "Divisibility and the division algorithm" in the broader system?
single
Q7.For "Greatest common divisor", which detail or constraint from the module is accurate?
single
Q8.Which definition of "Greatest common divisor" matches what the module established?
single
Q9.Which fact about "Bézout's identity and the extended Euclidean algorithm" matches the mechanism the module covered?
single
Q10.Which statement about how "Divisibility and the division algorithm" actually works is correct?
single