numere-prime
.ro
Language
Deutsch
English
Español
Français
Italiano
Română
Menu
factorizing
gcf, gcd
lcm
fractions
divisibility
divisors
1 - 10000
Euclid
How is ordinary fraction reduced (simplified):
30 / 48?
Reduce (simplify) ordinary fraction to lowest terms:
30 / 48 = ?
a / b = (a : gcf (a, b)) / (b : gcf (a, b))
30 / 48 =
(2 * 3 * 5) / (2
^{4}
* 3) =
((2 * 3 * 5) : (2 * 3)) / ((2
^{4}
* 3) : (2 * 3)) =
(30 : 6) / (48 : 6) =
5 / 8
Your browser does not support in-line iframes. Please enter this link:
here
Latest ordinary fractions reduced to lowest terms (simplified)
137 / 149 already reduced (simplified) to lowest terms
Dec-01 00:30
12 / 18 = (12 : 6) / (18 : 6) =
2 / 3
Dec-01 00:30
272 / 4 080 = (272 : 272) / (4 080 : 272) =
1 / 15
Dec-01 00:29
4 / 100 = (4 : 4) / (100 : 4) =
1 / 25
Dec-01 00:27
6 / 6 = (6 : 6) / (6 : 6) =
1
Dec-01 00:27
8 / 9 already reduced (simplified) to lowest terms
Dec-01 00:27
60 / 70 = (60 : 10) / (70 : 10) =
6 / 7
Dec-01 00:27
52 / 12 = (52 : 4) / (12 : 4) =
improper fraction: 13 / 3
rewrite:
13 : 3 = 4 and remainder = 1 =>
13 / 3 =
(4 * 3 + 1) / 3 =
4 +
^{1}
/
_{3}
=
mixed fraction: 4
^{1}
/
_{3}
Dec-01 00:27
13 / 40 already reduced (simplified) to lowest terms
Dec-01 00:26
212 / 45 already reduced (simplified) to lowest terms
improper fraction: 212 / 45
rewrite:
212 : 45 = 4 and remainder = 32 =>
212 / 45 =
(4 * 45 + 32) / 45 =
4 +
^{32}
/
_{45}
=
mixed fraction: 4
^{32}
/
_{45}
Dec-01 00:25
87 / 9 = (87 : 3) / (9 : 3) =
improper fraction: 29 / 3
rewrite:
29 : 3 = 9 and remainder = 2 =>
29 / 3 =
(9 * 3 + 2) / 3 =
9 +
^{2}
/
_{3}
=
mixed fraction: 9
^{2}
/
_{3}
Dec-01 00:24
9 / 8 already reduced (simplified) to lowest terms
improper fraction: 9 / 8
rewrite:
9 : 8 = 1 and remainder = 1 =>
9 / 8 =
(1 * 8 + 1) / 8 =
1 +
^{1}
/
_{8}
=
mixed fraction: 1
^{1}
/
_{8}
Dec-01 00:24
78 / 85 already reduced (simplified) to lowest terms
Dec-01 00:24
Ordinary fractions reduced to lowest terms (simplified) by users, list