MYP MYP Extended Mathematics

The maximum distance from the midline (mean value) to a peak or a trough.

If lengths scale by $k$ in a 2D enlargement, areas scale by $|k|^2$.

A sequence in which the difference between consecutive terms is constant.

A bearing is an angle measured clockwise from the North direction, usually written using three digits (for example, $135^\circ$).

A **bipartite graph** is a graph whose vertices can be divided into two sets so that every edge connects a vertex in one set to a vertex in the other set.

The line obtained by replacing an inequality sign with an equals sign. It separates the plane into regions that do or do not satisfy the inequality.

A fixed point $C$ such that each point of the image lies on the line from $C$ through the original point, and its distance from $C$ is multiplied by the scale factor.

A fixed point $C$ such that for any point $P$, the image point $P'$ lies on the line $CP$, and the distance from $C$ to $P$ is multiplied by the absolute value of the scale factor $|k|$ to get the distance from $C$ to $P'$.

For $a>0$, $a\neq 1$, $b>0$, and any convenient base $c>0$, $c\neq 1$:
$$\log_a b=\frac{\log_c b}{\log_c a}$$
Common choices are $c=10$ (using $\log$) or $c=e$ (using $\ln$).

The problem of finding a shortest closed route that traverses every edge of a weighted graph at least once.

A vector written in component form as $\binom{x}{y}$, representing a translation of $x$ units horizontally and $y$ units vertically.

A vector written as $\binom{x}{y}$ that represents a **translation** of $x$ units horizontally and $y$ units vertically.

The constant value $d$ such that $u_{n+1}-u_n=d$ for every term in an arithmetic sequence.

The constant multiplier $r$ in a geometric sequence, found by dividing a term by the previous term: $r=\frac{u_{n+1}}{u_n}$.

A graph where every pair of distinct vertices is joined by an edge.

Two inequalities written together, such as $a<x<b$, meaning both $a<x$ and $x<b$ must be true at the same time.

The conditional probability of an event $B$ given that $A$ has occurred is written $P(B \mid A)$. The conditional probability of an event $B$ given that $A$ has occurred is written $P(B \mid A)$.

A graph where every vertex can be reached from every other vertex by traveling along edges (possibly using several edges).

A number between $-1$ and $1$ that measures the strength and direction of a linear relationship between two variables.

A formula for any triangle that relates a side length to the other two side lengths and the cosine of the included angle. For triangle $ABC$: $a^{2}=b^{2}+c^{2}-2bc\cos A$ (and similarly for $b$ and $c$).

A path that starts and ends at the same vertex and does not pass through any vertex more than once.

The **degree** of a vertex is the number of edges meeting at that vertex (counting multiple edges separately).

Also called an enlargement or a reduction, is a transformation that changes the size of a figure but keeps its shape.

A collection of vertices (nodes) connected by edges (links) that have a specific direction.