Consider a binary tree with $2^n$ nodes.

We give generators for the isomorphisms of the tree: at each non-leaf vertex, swap the branches descending from that node.

• What is the action of a given word?
• Write a word which produces the required isomorphism
• Which generators commute?
• What is the order of each generator?
• Write one of the (non-root) generators in terms of the others.
• Which permutations of the leaves are possible?
• What is the order of the group of isomorphisms?
• What is the order of the quotient group obtained by identifying all the leaves of one branch?

No description given

No description given

The student is given a number in base 10 and asked to write it in a given base, between 2 and 16. The number has at most 3 digits in the other base.

Until it's possible to derive the expected answer for a part in the marking algorithm (see the issue tracker), this question has "show expected answer" turned off, because it just shows the base 10 number.

No description given

No description given

Given th original formula the student enters the transformed formula

Multiple solution of sin

Given the original formula the student enters the transformed formula

Given the original formula the student enters the transformed formula

Given the original formula the student enters the transformed formula

Find a regression equation.

This test will assess a students ability to work with piecewise and composite functions.

No description given

Face, Place and actual value, adding, subtracting, multiplying, dividing and rounding decimals.

Introductory exercise about set equality

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

This question defines an otherwise-pointless pre-submit task of "wait for a while" before marking the student's answer, in order to demonstrate how to use the pre-submit tasks feature.

Practice of conversion between SI units of mass, volume & length.

A question to practice simplifying fractions with the use of factorisation (for binomial and quadratic expressions).

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)$

Use two points on a line graph to calculate the gradient and $y$-intercept and hence the equation of the straight line running through both points.

The answer box for the third part plots the function which allows the student to check their answer against the graph before submitting.

This particular example has a positive gradient.