Rearrange some expressions involving logarithms by applying the relation $\log_b(a) = c \iff a = b^c$.

A basic introduction to differentiation

Show one of several blocks of text depending on the value of a question variable.

As well as a simple check for the value of a variable, the condition to display a block of text can be a complex expression in any of the question variables - in this example, depending on the discriminant of the generated quadratic.

Differentiate $f(x) = (a x + b)/ \sqrt{c x + d}$ and find $g(x)$ such that $ f^{\prime}(x) = g(x)/ (2(c x + d)^{3/2})$.

Differentiate $f(x) = (a x + b)/ \sqrt{c x + d}$ and find $g(x)$ such that $ f^{\prime}(x) = g(x)/ (2(c x + d)^{3/2})$.

No description given

The derivative of $\displaystyle \frac{a+be^{cx}}{b+ae^{cx}}$ is $\displaystyle \frac{pe^{cx}} {(b+ae^{cx})^2}$. Find $p$.

The derivative of $\displaystyle \frac{a+be^{cx}}{b+ae^{cx}}$ is $\displaystyle \frac{pe^{cx}} {(b+ae^{cx})^2}$. Find $p$.

Find $\displaystyle \frac{d}{dx}\left(\frac{m\sin(ax)+n\cos(ax)}{b\sin(ax)+c\cos(ax)}\right)$. Three part question.

Inputting algebraic expressions into Numbas.

Inputting ratios of algebraic 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)$

Create a truth table for a logical expression of the form $a \operatorname{op} b$ where $a, \;b$ can be the Boolean variables $p,\;q,\;\neg p,\;\neg q$ and $\operatorname{op}$ one of $\lor,\;\land,\;\to$.

For example $\neg q \to \neg p$.

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,\;\neg p,\;\neg q$ and each of $\operatorname{op1},\;\operatorname{op2},\;\operatorname{op3},\;\operatorname{op4}$ one of $\lor,\;\land,\;\to$.

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

Create a truth table for a logical expression of the form $a \operatorname{op} b$ where $a, \;b$ can be the Boolean variables $p,\;q,\;\neg p,\;\neg q$ and $\operatorname{op}$ one of $\lor,\;\land,\;\to$.

For example $\neg q \to \neg p$.

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,\;\neg p,\;\neg q$ and each of $\operatorname{op1},\;\operatorname{op2},\;\operatorname{op3},\;\operatorname{op4}$ one of $\lor,\;\land,\;\to$.

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

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

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

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

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

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$

What is the value of the expression given a choice of n?

Rearrange some expressions involving logarithms by applying the relation $\log_b(a) = c \iff a = b^c$.

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

Some practice collecting like terms of algebraic expressions, with detailed advice.

Adapted from 'Collecting like terms' by Ben Brawn.

Eight expressions, of increasing complexity. The student must simplify them by expanding brackets and collecting like terms.

Simplifying algebraic expressions

Use the rule $\log_a(n^b) = b\log_a(n)$ to rearrange some expressions.

Use the rule $\log_a(n^b) = b\log_a(n)$ to rearrange some expressions.

Use the rule $\log_a(n^b) = b\log_a(n)$ to rearrange some expressions.

Create a truth table for a logical expression of the form $a \operatorname{op} b$ where $a, \;b$ can be the Boolean variables $p,\;q,\;\neg p,\;\neg q$ and $\operatorname{op}$ one of $\lor,\;\land,\;\to$.

For example $\neg q \to \neg p$.