Pick four numbers from $1900\dots 2015$ and ask the student to factorise them.

Custom marking scripts make sure the student has entered a complete factorisation.

Factorising 5 to 7 digit numbers into a product of prime powers.

Uses the marking algorithms from question 1 of this CBA

Number Theory. 

Given $n \in \mathbb{N}$ find $\mu(n),\;\tau(n),\;\sigma(n),\;\phi(n).$

Given $\frac{a}{b} \in \mathbb{Q}$ for suitable choices of $a$ and $b$, find all $n \in \mathbb{N}$ such that $\phi(n)=\frac{a}{b}n$.

Given one solution of the quadratic equation in $\mathbb{Z}_n$ where $n=pq$ is a product of two primes find the other 3 solutions.

Given $m \in \mathbb{N}$, find all $n \in \mathbb{N}$ such that $\phi(n)=m$ and enter the largest and second largest if they exist.

Given $m \in \mathbb{N}$, find values of $n\in \mathbb{N}$ such that $\sigma(n)=m$.

There are at most two such solutions in this question.

Given $m \in \mathbb{N}$, find the smallest natural number $n \in \mathbb{N}$ with $\tau(n)=m$ divisors.

One-way ANOVA example

Calculations in $\mathbb{Z_n}$ for three values of $n$.     

No description given

No description given

Given two propositions in mathematics using quantifiers, choose the corresponding negation of the proposition. For example, the negation of: $\displaystyle \exists a \in \mathbb{R^+},\;\exists b \in \mathbb{N},\;\exists c \in \mathbb{N}\;\left[(c \lt b+1) \land \left(\frac{1}{2^n} \geq 3a\right)\right]$

English sentences are given and for each the appropriate proposition involving quantifiers is to be chosen. Also choose whether the propositions are true or false.

No description given

No description given

No description given

Express various integers and rationals mod $\mathbb{Z}_3, \;\mathbb{Z}_5,\;\mathbb{Z}_7,\;\mathbb{Z}_{11}$

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.

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$

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.

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$

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$

Modular arithmetic

Statistics and probability. Practice exam, one-way Anova for PSY2010.

Questions about logical predicates, and basic set theory concepts.

Practice questions on these topics.

Trying out something: get the student to enter a set for each of "regular singular points" and "essential singular points".

Find and classify singular points of a second-order ordinary differential equation.  One equation is chosen from a selection of 10.

The random variable $X$ has a PDF which involves a parameter $c$. Find the value of $c$. Find the distribution function $F_X(x)$ and $P(a \lt X \lt b)$.

Also find the expectation $\displaystyle \operatorname{E}[X]=\int_{-\infty}^{\infty}xf_X(x)\;dx$.

Given a 3x3 matrix with very big elements, perform row operations to find a matrix with single-digit elements. Then reduce that to an upper triangular matrix, and hence find the determinant.