Modular arithmetic calculator worksheet with answers
Further maths: Further maths Tiers are typical for England, Wales and Northern Ireland specifications. Boards differ, so check your own specification.
10 practice questions on modular arithmetic calculator. Print the questions on their own, or with the answers. Worked solutions for any question are one click away in the solver.
Name: ______________ Date: ________ Score: ____ / 10
3^100 mod 77^200 mod 13-7 mod 37^200 mod 11-9 mod 6inverse of 6 mod 23solve 3x ≡ 5 mod 7solve 7x = 1 mod 102^100 mod 46^200 mod 11
Answers
3^100 mod 7Show the working
- Use repeated squaring, reducing mod 7 at every stepNever work out the huge power first: reduce after each multiplication.
- Binary of the powerMultiply in the squares that match each 1 bit.
- Result
- Check: multiply 100 times, reducing each time
7^200 mod 13Show the working
- Use repeated squaring, reducing mod 13 at every stepNever work out the huge power first: reduce after each multiplication.
- Binary of the powerMultiply in the squares that match each 1 bit.
- Result
- Check: multiply 200 times, reducing each time
-7 mod 3Show the working
- Divide and find the remainderThe remainder is always between 0 and 2, even for negative numbers.
- Check: rebuild the number
7^200 mod 11Show the working
- Use repeated squaring, reducing mod 11 at every stepNever work out the huge power first: reduce after each multiplication.
- Binary of the powerMultiply in the squares that match each 1 bit.
- Result
- Check: multiply 200 times, reducing each time
-9 mod 6Show the working
- Divide and find the remainderThe remainder is always between 0 and 5, even for negative numbers.
- Check: rebuild the number
inverse of 6 mod 23Show the working
- Extended Euclid: find x with 6x + 23y = 1Reducing x mod 23 gives 4.
- Check: multiply and reduce
solve 3x ≡ 5 mod 7Show the working
- The congruence
- gcd testThe gcd is 1, so there is exactly one solution mod 7.
- Check: substitute each solution
solve 7x = 1 mod 10Show the working
- The congruence
- gcd testThe gcd is 1, so there is exactly one solution mod 10.
- Check: substitute each solution
2^100 mod 4Show the working
- Use repeated squaring, reducing mod 4 at every stepNever work out the huge power first: reduce after each multiplication.
- Binary of the powerMultiply in the squares that match each 1 bit.
- Result
- Check: multiply 100 times, reducing each time
6^200 mod 11Show the working
- Use repeated squaring, reducing mod 11 at every stepNever work out the huge power first: reduce after each multiplication.
- Binary of the powerMultiply in the squares that match each 1 bit.
- Result
- Check: multiply 200 times, reducing each time
Learn the method: Modular arithmetic calculator solver and worked examples. All worksheets: worksheet index.