Definition of LCM

LCM stands for least common multiple. In mathematics, LCM of two numbers 55 and 66, is defined as the smallest positive integer that is divisible by both. It is written as LCM(55, 66).

Properties of LCM

  • The LCM of two given numbers is never less than any of those numbers. Eg- LCM of 55 and 66 is 330, where 55 and 66 are less than 330.
  • LCM is commutative which means LCM(a, b, c) = LCM(LCM(a, b), c) = LCM(a, LCM(b, c)).
  • The LCM of two or more prime numbers is exactly equal to their product.
  • LCM is associative which means LCM(55, 66) = LCM(66, 55).
  • LCM is distributive, which means LCM(ab, bc, ad) = d * LCM(x, y, z).

Steps to find lcm of 55 and 66 by Listing Method

Example: Find lcm of 55 and 66 by Listing Method

  • Multiples of 55: 55, 110, 165, 220, 275, 330, 385, 440, 495, 550, 605, 660, 715, 770, 825, 880, 935, 990, 1045, 1100, 1155, 1210, 1265, 1320, 1375, 1430, 1485, 1540, 1595, 1650, 1705, 1760, 1815, 1870, 1925, 1980, 2035, 2090, 2145, 2200, 2255, 2310, 2365, 2420, 2475, 2530, 2585, 2640, 2695, 2750, 2805, 2860, 2915, 2970, 3025, 3080, 3135, 3190, 3245, 3300, 3355, 3410, 3465, 3520, 3575, 3630
  • Multiples of 66: 66, 132, 198, 264, 330, 396, 462, 528, 594, 660, 726, 792, 858, 924, 990, 1056, 1122, 1188, 1254, 1320, 1386, 1452, 1518, 1584, 1650, 1716, 1782, 1848, 1914, 1980, 2046, 2112, 2178, 2244, 2310, 2376, 2442, 2508, 2574, 2640, 2706, 2772, 2838, 2904, 2970, 3036, 3102, 3168, 3234, 3300, 3366, 3432, 3498, 3564, 3630

Hence, LCM of 55 and 66 is 330.

Steps to find LCM of 55 and 66 by Common Division Method

Example: Find lcm of 55 and 66 by Common Division Method

2 55 66
3 55 33
5 55 11
11 11 11
1 1

Hence, LCM of 55 and 66 is 2 x 3 x 5 x 11 = 330.

Steps to find lcm of 55 and 66 by Formula

Example: Find lcm of 55 and 66 by Formula

  • GCF of 55 and 66 = 11
  • LCM of 55 and 66 = (55 x 66) / 11
  • => 3630 / 11

Hence, LCM of 55 and 66 is 330.

Examples

Franky and Joy are running on a circular track. They start at the same time. They take 55 and 66 minutes respectively to go round once. Find at what time they will run together?

Franky and Joy are running on a circular track. They take 55 and 66 minutes respectively to go round once. We need to find out at what time (minimum) they will run together again. For this we need to find the LCM of 55 and 66.
So, LCM of 55 and 66 is 330.

Boxes that are 55 inches tall are being pilled next to boxes that are 66 inches tall. What is the least height in feet at which the two piles will be the same height?

To find the least height in feet at which the two piles will be at same height we will find LCM of 55 and 66.
So, LCM of 55 and 66 is 330.

Sammy's company prints 55 textbooks at a time. Daniel's company prints textbooks in sets of 66 at a time. According to a survey done by a committee, both companies printed the same number of textbooks last year. Find the least number of books that each company would have printed.

To find the least number of textbooks that each company could have printed we need to find the LCM of 55 and 66.
So, LCM of 55 and 66 is 330.

Ariel exercises every 55 days and Rubel every 66 days. They both excercised today. How many days will it be until they excercise together again?

The problem can be solved using LCM, because we are trying to figure out the least time until they excercise together again.
So, LCM of 55 and 66 is 330.

Find the LCM of 55 and 66 using GCF method.

Greatest common factor or gcf of 55 and 66 is GCF(55, 66) x LCM(55, 66) = (55 x 66) / GCF(55, 66) = 330.

Find the least common multiple of 55 and 66.

Least common multiple of 55 and 66 is 330.

Find the least number which is exactly divisible by 55 and 66.

Least number which is exactly divisible by 55 and 66 is 330.