How do we define LCM?

LCM, abbreviation for least common multiple, is defined as the smallest number that is the product of two or more numbers 17 and 33

Properties of LCM

  • The LCM of two or more prime numbers is exactly equal to their product.
  • LCM is associative which means LCM(17, 33) = LCM(33, 17).
  • LCM is commutative which means LCM(a, b, c) = LCM(LCM(a, b), c) = LCM(a, LCM(b, c)).
  • LCM is distributive, which means LCM(ab, bc, ad) = d * LCM(x, y, z).
  • The LCM of two given numbers is always greater than the given numbers numbers. Eg- LCM of 17 and 33 is 561, where 561 is greater than 17 and 33.

Steps to find lcm of 17 and 33 by Listing Method

Example: Find lcm of 17 and 33 by Listing Method

  • Multiples of 17: 17, 34, 51, 68, 85, 102, 119, 136, 153, 170, 187, 204, 221, 238, 255, 272, 289, 306, 323, 340, 357, 374, 391, 408, 425, 442, 459, 476, 493, 510, 527, 544, 561
  • Multiples of 33: 33, 66, 99, 132, 165, 198, 231, 264, 297, 330, 363, 396, 429, 462, 495, 528, 561

Hence, LCM of 17 and 33 is 561.

Steps to find LCM of 17 and 33 by Common Division Method

Example: Find lcm of 17 and 33 by Common Division Method

3 17 33
11 17 11
17 17 1
1 1

Hence, LCM of 17 and 33 is 3 x 11 x 17 = 561.

Steps to find lcm of 17 and 33 by Formula

Example: Find lcm of 17 and 33 by Formula

  • GCF of 17 and 33 = 1
  • LCM of 17 and 33 = (17 x 33) / 1
  • => 561 / 1

Hence, LCM of 17 and 33 is 561.

Examples

Franky and Joy are running on a circular track. They start at the same time. They take 17 and 33 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 17 and 33 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 17 and 33.
So, LCM of 17 and 33 is 561.

A shopkeeper sells candies in packet of 17 and chocolates in packet of 33. What is the least number of candies and chocolates Annie should buy so that there will be one candy for each chocolate?

The least number of candies and chocolates Annie should buy so that there will be one candy for each chocolate we need to find the lcm of 17 and 33.
So, LCM of 17 and 33 is 561.

Boxes that are 17 inches tall are being pilled next to boxes that are 33 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 17 and 33.
So, LCM of 17 and 33 is 561.

Sammy's company prints 17 textbooks at a time. Daniel's company prints textbooks in sets of 33 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 17 and 33.
So, LCM of 17 and 33 is 561.

What is the relation between LCM and GCF( Greatest Common Factor)?

Greatest common factors or gcf of 17 and 33 is GCF(17, 33) * LCM(17, 33) = (17 x 33) / GCF(17, 33) = 561.

Find the least number which is exactly divisible by 17 and 33.

Least number which is exactly divisible by 17 and 33 is 561.

Find the LCM of 17 and 33 using GCF method.

Greatest common factor or gcf of 17 and 33 is GCF(17, 33) x LCM(17, 33) = (17 x 33) / GCF(17, 33) = 561.