Improper Fraction
Fractions & DecimalsAn improper fraction is a fraction where the numerator is greater than or equal to the denominator, representing a value of one or more wholes.
Definition
An improper fraction is a fraction where the top number is bigger than or equal to the bottom number. It means you have one whole or more. Examples: $5/4$, $9/3$, $7/7$.
Example
$7/4$ is improper because $7$ is bigger than $4$. Think of it as $7$ quarter-slices of pizza. Since $4$ quarters make one whole pizza, $7$ quarters is $1$ whole pizza plus $3$ extra slices ($1$ and $3/4$ pizzas).
Key Insight
Improper fractions are not wrong or broken - "improper" just means the value is at least $1$. They are especially useful in multiplication and division because they are easier to work with than mixed numbers.
Definition
An improper fraction $a/b$ satisfies $a \ge b > 0$ (for positive fractions), meaning its value is greater than or equal to $1$. Every improper fraction can be converted to a mixed number by dividing the numerator by the denominator: quotient becomes the whole number, remainder becomes the new numerator.
Example
Convert $17/5$ to a mixed number: $17/5 = 3$ remainder $2$, so $17/5 = 3$ and $2/5$. Verify: $3 \times 5 + 2 = 17$. Going back: $3$ and $2/5 = (3 \times 5 + 2)/5 = 17/5$.
Key Insight
When multiplying or dividing mixed numbers, it is essential to convert to improper fractions first. Trying to multiply $2$ and $1/2$ times $1$ and $1/3$ directly leads to errors; converting to $5/2$ times $4/3 = 20/6 = 10/3 = 3$ and $1/3$ is far more reliable.
Definition
An improper fraction $a/b$ with $a \ge b > 0$ has floor value $\lfloor a/b \rfloor \ge 1$. The conversion to mixed number uses the division algorithm: $a = qb + r$ with $0 \le r < b$, giving $a/b = q + r/b$. This is the rational-number analogue of expressing a real number via its integer and fractional parts.
Example
In the Euclidean algorithm, each step produces a fraction with progressively smaller numerator/denominator, eventually terminating in an improper fraction $a/a = 1$ or a proper fraction. The algorithm's termination relies on strict decrease: each remainder $r$ satisfies $r < b$.
Key Insight
Continued fractions generalize improper fractions: any rational $a/b$ decomposes as $a_0 + \cfrac{1}{a_1 + \cfrac{1}{a_2 + \ldots}}$ with finitely many terms. The partial quotients $a_0, a_1, \ldots$ come directly from the Euclidean algorithm on $a$ and $b$.