Find the solution of a constant coefficient second order ordinary differential equation of the form $ay''+by=0$. Complex roots.

Solve 4 first order differential equations of two types:$\displaystyle \frac{dy}{dx}=\frac{ax}{y},\;\;\frac{dy}{dx}=\frac{by}{x},\;y(2)=1$ for all 4.

rebelmaths

Solve: $\displaystyle \frac{d^2y}{dx^2}+2a\frac{dy}{dx}+a^2y=0,\;y(0)=c$ and $y(1)=d$.  (Equal roots example).

Some quadratics are to be solved by factorising

A quadratic equation (equivalent to $(x+a)^2-b$) is given and sketched. Three equations are given that can be solved using the graph. There is a chance there will only be one solution.

A few quadratic equations are given, to be solved by completing the square. The number of solutions is randomised.

Solve the equation  5x - 8 = 32

Some quadratics are to be solved by factorising

Solve 4 first order differential equations of two types:$\displaystyle \frac{dy}{dx}=\frac{ax}{y},\;\;\frac{dy}{dx}=\frac{by}{x},\;y(2)=1$ for all 4.

rebelmaths

Using BIDMAS rules to solve equations

Some quadratics are to be solved by factorising

Calculate a repeated integral of the form $\displaystyle I=\int_0^1\;dx\;\int_0^{x^{m-1}}mf(x^m+a)dy$

The $y$ integral is trivial, and the $x$ integral is of the form $g'(x)f'(g(x))$, so it straightforwardly integrates to $f(g(x))$.

Solve a system of linear equations using Gaussian elimination.

Use the simplex method to solve a linear program.

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$

Find the solution of a constant coefficient second order ordinary differential equation of the form $ay''-by=0$. Distinct roots.

Find the solution of a constant coefficient second order ordinary differential equation of the form $ay''+by'+cy=0$.

Find the solution of a first order separable differential equation of the form $a\sin(x)y'=by\cos(x)$.

Find the solution of a first order separable differential equation of the form $(a+x)y'=b+y$.

Find the solution of a first order separable differential equation of the form $(a+y)y'=b+x$.

Find the solution of a first order separable differential equation of the form $axyy'=b+y^2$.

Given the following three vectors $\textbf{v}_1,\;\textbf{v}_2,\;\textbf{v}_3$ Find out whether they are a linearly independent set are not. Also if linearly dependent find the relationship $\textbf{v}_{r}=p\textbf{v}_{s}+q\textbf{v}_{t}$ for suitable $r,\;s,\;t$ and integers $p,\;q$.

Solve a linear programming problem, and perform sensitivity analysis.

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

Solve for $x$: $\displaystyle \frac{px+s}{ax+b} = \frac{qx+t}{cx+d}$ with $pc=qa$.