10 results.
-
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)$.
-
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$.
-
Question in Will's workspace
Asks students to calculate a Legendre symbol.
-
Question in Will's workspace
Asks students to calculate a Legendre symbol.
-
Question in Content created by Newcastle University by
Newcastle University Mathematics and Statistics
Factorising 5 to 7 digit numbers into a product of prime powers.
Uses the marking algorithms from question 1 of this CBA
-
Question in Content created by Newcastle University by
Newcastle University Mathematics and Statistics
Number Theory.
Given $n \in \mathbb{N}$ find $\mu(n),\;\tau(n),\;\sigma(n),\;\phi(n).$
-
Question in Content created by Newcastle University by
Newcastle University Mathematics and Statistics
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$.
-
Question in Content created by Newcastle University by
Newcastle University Mathematics and Statistics
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.
-
Question in Content created by Newcastle University by
Newcastle University Mathematics and Statistics
and 1 other
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.
-
Question in Content created by Newcastle University by
Newcastle University Mathematics and Statistics
Given $m \in \mathbb{N}$, find the smallest natural number $n \in \mathbb{N}$ with $\tau(n)=m$ divisors.
