Fraction Operations

Front

What is a fraction?

Back

A fraction represents a part of a whole and is expressed as a ratio of two integers, with a numerator (top number) and a denominator (bottom number).

Tags

CCSS.3.NF.A.1

CCSS.3.NF.A.2B

Front

How do you add fractions with different denominators?

Back

To add fractions with different denominators, first find a common denominator, convert the fractions to equivalent fractions with that denominator, and then add the numerators.

Tags

CCSS.5.NF.A.1

CCSS.5.NF.A.2

Front

What is the process for subtracting fractions?

Back

To subtract fractions, ensure they have a common denominator, convert them if necessary, and then subtract the numerators while keeping the common denominator.

Tags

CCSS.5.NF.A.1

CCSS.5.NF.A.2

Front

How do you multiply fractions?

Back

To multiply fractions, multiply the numerators together and the denominators together. Simplify the result if possible.

Tags

CCSS.5.NF.B.6

Front

What is the method for dividing fractions?

Back

To divide fractions, multiply the first fraction by the reciprocal of the second fraction (flip the second fraction and multiply).

Tags

CCSS.6.NS.A.1

Front

What is a mixed number?

Back

A mixed number is a whole number combined with a proper fraction, such as 2 1/2.

Tags

CCSS.3.NF.A.3C

Front

How do you convert an improper fraction to a mixed number?

Back

To convert an improper fraction to a mixed number, divide the numerator by the denominator. The quotient is the whole number, and the remainder over the original denominator is the fraction.

Front

What does it mean to simplify a fraction?

Back

Simplifying a fraction means reducing it to its lowest terms by dividing both the numerator and denominator by their greatest common divisor (GCD).

Front

What is the least common denominator (LCD)?

Back

The least common denominator (LCD) is the smallest multiple that is common to the denominators of two or more fractions.

Front

How do you find the GCD of two numbers?

Back

The greatest common divisor (GCD) of two numbers can be found using the Euclidean algorithm or by listing the factors of both numbers and identifying the largest common factor.