Search - Numbas at mathcentre.ac.uk

17 results.

Show results for Show results for

Questions
Exams

Refine by Refine by

Merryn's copy of Subtraction
Ready to use
Question in MESH by Merryn Horrocks and 1 other

The subtraction algortihm using the borrow and pay back method with integers.
Merryn's copy of Multiplication 2 digit by 2 digit
Ready to use
Question in MESH by Merryn Horrocks and 1 other

Multiplication algorithm with integers
Merryn's copy of Addition 1
Ready to use
Question in MESH by Merryn Horrocks and 1 other

Natural numbers addition algorithm. 2 and 3 digit numbers. Carrying.
Multiplication 2 digit by 2 digit
Ready to use
Question in pre-algebra Numeracy and Arithmetic by Ben Brawn

Multiplication algorithm with integers
Solve an equation in modular arithmetic
Doesn't work
Question in Content created by Newcastle University by Newcastle University Mathematics and Statistics

Solving an equation of the form $ax \equiv b\;\textrm{mod}\;n$ where $a$ and $n$ are coprime.
Long division (old)
Ready to use
Question in pre-algebra Numeracy and Arithmetic by Ben Brawn

No description given
Addition
Ready to use
Question in pre-algebra Numeracy and Arithmetic by Ben Brawn

Natural numbers addition algorithm. 2 and 3 digit numbers. Carrying.
Subtraction
Ready to use
Question in pre-algebra Numeracy and Arithmetic by Ben Brawn

The subtraction algortihm using the borrow and pay back method with integers.
Inverse algorithm calculator
Ready to use
Question in Julia Goedecke's contributions by Julia Goedecke and 1 other

Educational calculation tool rather than "question".

This allows the student to input a square matrix (max rows 5). Then the student can decide to swap some rows, or multiply some rows, or add multiples of one row to other rows. The student only has to input what operation should be performed, and this is automatically applied to the matrix and the identity matrix (or what it has got to). This question has no marks and no feedback as it's just meant as a "calculator". It has some checks in so students know when they are not entering a square matrix or a valid row number etc.

It has some rounding to 13 decimal places, as otherwise some fraction calculations become incorrectly displayed as a very small number instead of 0.

It would be possible to extend to more than 5 rows, one just has to put in a lot more variables and so on. I just had to choose some place to stop.
Use Bézout's algorithm to solve $as + bt = \gcd(a,b)$ ,
Ready to use
Question in Content created by Newcastle University by Newcastle University Mathematics and Statistics

Given two numbers, find the gcd, then use Bézout's algorithm to find $s$ and $t$ such that $as+bt=\operatorname{gcd}(a,b)$ .
Greatest common divisor and Bézout's algorithm
Ready to use
Question in Christian's workspace by Christian Lawson-Perfect

Given two numbers, find the gcd, then use Bézout's algorithm to find $s$ and $t$ such that $as+bt=\operatorname{gcd}(a,b)$ . Finally, find all solutions of an equation $\mod b$ .
Solve three congruences with the Chinese Remainder Theorem
Ready to use
Question in Content created by Newcastle University by Newcastle University Mathematics and Statistics

Solving three simultaneous congruences using the Chinese Remainder Theorem:

$\begin{eqnarray*} x\;&\equiv&\;b_1\;&\mod&\;n_1\\ x\;&\equiv&\;b_2\;&\mod&\;n_2\\x\;&\equiv&\;b_3\;&\mod&\;n_3 \end{eqnarray*}$ where $\operatorname{gcd}(n_1,n_2,n_3)=1$
Solve three congruences using Chinese Remainder Theorem
Draft
Question in Content created by Newcastle University by Newcastle University Mathematics and Statistics

Solving three simultaneous congruences using the Chinese Remainder Theorem:

$\begin{eqnarray*} x\;&\equiv&\;b_1\;&\mod&\;n_1\\ x\;&\equiv&\;b_2\;&\mod&\;n_2\\x\;&\equiv&\;b_3\;&\mod&\;n_3 \end{eqnarray*}$ where $\operatorname{gcd}(n_1,n_2,n_3)=1$
Solve congruence in given range
Has some problems
Question in Content created by Newcastle University by Newcastle University Mathematics and Statistics

Solving an equation of the form $ax \equiv\;b\;\textrm{mod}\;n$ where $\operatorname{gcd}(a,n)|r$ . In this case we can find all solutions. The user is asked for the two greatest.
Solve a pair of congruences
Draft
Question in Content created by Newcastle University by Newcastle University Mathematics and Statistics

Solving two simultaneous congruences:

$\begin{eqnarray*} c_1x\;&\equiv&\;b_1\;&\mod&\;n_1\\ c_2x\;&\equiv&\;b_2\;&\mod&\;n_2\\ \end{eqnarray*}$ where $\operatorname{gcd}(c_1,n_1)=1,\;\operatorname{gcd}(c_2,n_2)=1,\;\operatorname{gcd}(n_1,n_2)=1$
Solve a pair of congruences
Draft
Question in Content created by Newcastle University by Newcastle University Mathematics and Statistics

Solving a pair of congruences of the form
$\begin{align}x &\equiv b_1\;\textrm{mod} \;n_1\\x &\equiv b_2\;\textrm{mod}\;n_2 \end{align}$ where $n_1,\;n_2$ are coprime.
Find numbers modulo a base
Draft
Question in Content created by Newcastle University by Newcastle University Mathematics and Statistics

Modular arithmetic. Find the following numbers modulo the given number $n$ . Three examples to do.

Show results for Show results for

Refine by Refine by

Status

Author

Tags

Usage rights

Ability Level

Topics