Newcastle University Mathematics and Statistics

Create a truth table for a logical expression of the form $((a \operatorname{op1} b) \operatorname{op2}(c \operatorname{op3} d))\operatorname{op4}(e \operatorname{op5} f) $ where each of $a, \;b,\;c,\;d,\;e,\;f$ can be one the Boolean variables $p,\;q,\;\neg p,\;\neg q$ and each of $\operatorname{op1},\;\operatorname{op2},\;\operatorname{op3},\;\operatorname{op4},\;\operatorname{op5}$ one of $\lor,\;\land,\;\to$.

For example: $((q \lor \neg p) \to (p \land \neg q)) \to (p \lor q)$

Create a truth table for a logical expression of the form $((a \operatorname{op1} b) \operatorname{op2}(c \operatorname{op3} d))\operatorname{op4}e $ where each of $a, \;b,\;c,\;d,\;e$ can be one the Boolean variables $p,\;q,\;r,\;\neg p,\;\neg q,\;\neg r$ and each of $\operatorname{op1},\;\operatorname{op2},\;\operatorname{op3},\;\operatorname{op4}$ one of $\lor,\;\land,\;\to$.

For example: $((q \lor \neg r) \to (p \land \neg q)) \land \neg r$

One question on determining whether statements are propositions.

Four questions on find truth tables for various logical expressions.

Questions on using quantifiers.

Statistics and probability. 2 questions. Both simple regression. First with 8 data points, second with 10. Find $a$ and $b$ such that $Y=a+bX$. Then find the residual value for one of the data points.

Approximate the integral of a function by Riemann sums.

Some more questions on set theory - covering set builder notation, cartesian products, complements.

Find gcd g of two positive integers x, y and also find integers a, b such that ax+by=g with prescribed intervals for a and b.

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.