PractiseQuestion bank
Original exam-style questions, mapped to your syllabus. Answers are checked for mathematical equivalence and every attempt updates your mastery.
Sign in to check answers. Your attempts build your mastery and error book.
12 questions
SA-FP-NT-0041 markL1 FoundationNon-calculatorFermat
Find 4872mod9 using the digit sum. Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-G011 markL1 FoundationNon-calculatorCongruences
Find 47mod5. Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-Q011 markL1 FoundationNon-calculatorCongruences
a≡b(modn) means Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-X011 markL1 FoundationNon-calculatorEuclid
Find gcd(84,36). Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-X021 markL1 FoundationNon-calculatorCongruences
Find 34mod5. Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-0012 marksL2 StandardNon-calculatorEuclid
Use the Euclidean algorithm to find gcd(252,198). Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-0022 marksL2 StandardNon-calculatorCongruences
Solve 3x≡4(mod7), giving 0≤x<7. Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-X032 marksL2 StandardNon-calculatorCongruences
Solve 5x≡3(mod7), giving 0≤x<7. Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-X041 markL2 StandardNon-calculatorFermat
Use Fermat's little theorem to find 210mod11. Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-0033 marksL3 ExamNon-calculatorFermat
Find 2100mod7. Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-X052 marksL3 ExamNon-calculatorFermat
Find the last digit of 7100. Salam Academy Original Practice · Proposed mark scheme
SA-FP-NT-0054 marksL4 ChallengingNon-calculatorEuclid
Find the smallest positive integer x for which there is an integer y with 252x+198y=18. Salam Academy Original Practice · Proposed mark scheme