Some quadratics are to be solved by factorising

Question is to calculate the area bounded by a cubic and the $x$-axis. Requires finding the roots by solving a cubic equation. Calculator question

Putting a pair of linear equations into matrix notation and then solving by finding the inverse of the coefficient matrix. 

Solving equations for x

Calculate the local extrema of a function ${f(x) = e^{x/C1}(C2sin(x)-C3cos(x))}$

The graph of f(x) has to be identified.

The first derivative of f(x) has to be calculated. 

The min max points have to be identified using the graph and/or calculated using the first derivative method.  Requires solving trigonometric equation

Some quadratics are to be solved by factorising

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$

Solve for $x$ and $y$:  \[ \begin{eqnarray} a_1x+b_1y&=&c_1\\   a_2x+b_2y&=&c_2 \end{eqnarray} \]

The included video describes a more direct method of solving when, for example, one of the equations gives a variable directly in terms of the other variable.

Solve $\displaystyle ax + b = cx + d$ for $x$.

Solve for $x$: $\displaystyle ax ^ 2 + bx + c=0$.

Solve for $x$: $\displaystyle \frac{a} {bx+c} + d= s$

Solve for $x$ and $y$:  \[ \begin{eqnarray} a_1x+b_1y&=&c_1\\   a_2x+b_2y&=&c_2 \end{eqnarray} \]

Solving simple linear equations in $\mathbb{Q}$ and $\mathbb{Z}_n$ for $n= 13, \;17$ or $19$.

In the first three parts, rearrange linear inequalities to make $x$ the subject.

In the last four parts, correctly give the direction of the inequality sign after rearranging an inequality.

This question tests the student's ability to solve simple linear equations by elimination. Part a) involves only having to manipulate one equation in order to solve, and part b) involves having to manipulate both equations in order to solve. 

This question tests the students ability to factorise simple quadratic equations (where the coefficient of the x^2 term is 1) and use the factorised equation to solve the equation when it is equal to 0.

Questions involving various techniques for rearranging and solving quadratic expressions and equations

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$

No description given

No description given

No description given

No description given

No description given