Arithemetic Flashcards
Common fraction - decimal conversions
1/3
0.333
Greatest common divisor Using Euclid’s algorithm
A much more efficient method is the Euclidean algorithm, which uses a division algorithm such as long division in combination with the observation that the gcd of two numbers also divides their difference. Ignore the quotient in each step except to notice when the remainder reaches 0, signalling that we have arrived at the answer.
gfc(a,b)
a -> remainder1 -> remainder2
__ __________ ___________
b a remainder1
GFC=quotient when remainder =0
To compute gcd(48,18), divide 48 by 18 to get a quotient of 2 and a remainder of 12. Then divide 18 by 12 to get a quotient of 1 and a remainder of 6. Then divide 12 by 6 to get a remainder of 0, which means that 6 is the gcd.
Common fraction - decimal conversions
1/5 =
0.2
Common fraction - decimal conversions
1/6 =
1/2 *1/3 = 0.333/2 = 0.167
Common fraction - decimal conversions
1/8 =
1/2 * 1/4 = 0.25/2 = 0.125
Common fraction - decimal conversions
1/9 =
1/3 * 1/3 = 0.333/3 = 0.111
Common fraction - decimal conversions
1/7 =
0.143
Manipulating fractions
4/9 =
4 * 1/9 = 4 * 0.111 = 0.444
Manipulating fractions
7/8 =
1 - 1/8 = 1 - 0.125 = 0.875
Multiplying large numbers - trick
Using answers
Check answers where units digit agrees
If there is more than 1, use approximation
Multiplication Table
6 x 12
72
Multiplication Table
6 x 13
78
Multiplication Table
6 x 14
84
Multiplication Table
6 x 15
90
Multiplication Table
7 x12
84
Multiplication Table
7 x13
91
Multiplication Table
7 x 14
98
Multiplication Table
7 x 15
105
Multiplication Table
8 x 12
96
Multiplication Table
8 x 13
104
Multiplication Table
8 x 14
112
Multiplication Table
8 x 15
120
Multiplication Table
9 x 12
108
Multiplication Table
9 x 13
117
Multiplication Table
9 x 14
126