- \n
- Listing Multiples<\/span><\/li>\n
- Prime Factorization<\/span><\/li>\n
- Ladder Method<\/span><\/li>\n
- Division Method<\/span><\/li>\n
- Using the GCF (Greatest Common Factor)<\/span><\/li>\n<\/ul>\n
We will learn about them one by one.<\/span><\/p>\n
<\/p>\n
LCM of Three Numbers by Listing Multiples<\/b><\/h2>\n
<\/b><\/p>\n
Write down the multiples of each number until one of the multiples is present on all lists, which are known as common multiples. Now Find the smallest common multiple. This number is the required LCM.<\/span><\/p>\n
<\/span><\/p>\n
Example: <\/span>LCM of 2, 4, and 12.<\/b><\/p>\n
Multiples of each number –\u00a0<\/span><\/p>\n
2:\u00a0 2, 4, 6, 8, 10, <\/span>12<\/b>, 14, 16, 18, 20, 22<\/span><\/p>\n
4:\u00a0 4, 8, <\/span>12<\/b>, 16, 20, 24, 28, 32, 36, 40<\/span><\/p>\n
12:\u00a0 <\/span>12<\/b>, 24, 36, 48, 60, 72,<\/span><\/p>\n
The common multiple of three numbers is 12 (bold and underlined)<\/span><\/p>\n
So, the <\/span>required LCM = 12<\/b><\/p>\n
<\/p>\n
LCM of Three Numbers by Prime Factorization<\/b><\/h2>\n
<\/b><\/p>\n
First, we do prime factorization of the given numbers. Then list all the prime numbers found as they occur most times for any given number. Now, multiply the list of prime factors together for finding the LCM.<\/span><\/p>\n
Example: <\/span>LCM of 4, 12 and 18.<\/b>\u00a0<\/span><\/p>\n
Prime factorization of each number –\u00a0<\/span><\/p>\n
4 = 2 <\/span>\u00d7 2<\/span><\/p>\n
12 = 2 <\/span>\u00d7 2 \u00d7 3<\/span><\/p>\n
20 = 2 <\/span>\u00d7 2 \u00d7 5<\/span><\/p>\n
Now, look at the prime factorization of 4, 12 and 20.\u00a0<\/span><\/p>\n
The prime number 2 occurs most often for two times. (<\/span>2 <\/span>\u00d7 2 is present in the prime factorization of each number)<\/span><\/p>\n
The prime number 3 occurs most often for one time. (3 is present only once in the prime factorization of 12 only)<\/span><\/p>\n
The prime number 5 occurs most often for one time. (5 is present only once in the prime factorization of 20 only)<\/span><\/p>\n
Multiplying all the prime numbers as each occurs most often, we find 2 \u00d7 2 \u00d7 3 \u00d7 5 = 60.<\/span><\/p>\n
So, the <\/span>required LCM = 60.<\/b><\/p>\n
<\/p>\n
LCM of Three Numbers by Ladder Method<\/b><\/h2>\n
<\/b><\/p>\n
Write down all three numbers in a row. Divide the numbers in the row with a prime number that evenly divides at least two or more numbers and write the result into the next row.<\/span><\/b><\/p>\n
If any number in the layer or row is not divisible, just write it down as it is. Continue dividing rows by prime numbers until there are no more prime numbers that divide evenly two or more numbers.<\/span><\/p>\n
Example:\u00a0 <\/span>LCM of 10, 12 and 15.<\/b><\/p>\n
<\/b><\/p>\n
![\"\"](\"https:\/\/eistudymaterial.s3.amazonaws.com\/lcm-of-three-numbers-01.png\")
<\/b><\/p>\n<\/span><\/p>\n
<\/span><\/p>\n
Multiply the numbers in the L shape (left column and bottom row), required LCM = 2 \u00d7 3 \u00d7 5 \u00d7 1 \u00d7\u00a0 2 \u00d7 1 = 60.<\/span><\/p>\n
<\/span><\/p>\n
<\/span><\/p>\n
LCM of Three Numbers by Division Method<\/b><\/h2>\n
<\/b><\/p>\n
Write down all the numbers in a row. Divide the numbers with such a prime number which evenly divides at least one of the numbers, and write the result into the next row. If any number is not divisible, write it down as it is.<\/span><\/b><\/p>\n
Keep dividing with prime numbers that divide at least one number until we get only 1\u2019s in the final row.<\/span><\/b><\/p>\n
<\/span><\/p>\n
Example: LCM of 10, 16 and 27.<\/strong><\/span><\/p>\n
![\"\"](\"https:\/\/eistudymaterial.s3.amazonaws.com\/lcm-of-three-numbers-02-162x300.png\")
<\/span><\/p>\n<\/span><\/p>\n
Multiply<\/span> the prime numbers in the first column.<\/span><\/p>\n
So the required LCM = 2 \u00d7 2 \u00d7 2 \u00d7 2 \u00d7 3 \u00d7 3 \u00d7 3 \u00d7 5 = 2160.<\/span><\/p>\n
<\/span><\/p>\n
LCM of Three Numbers by GCF<\/b><\/h2>\n
<\/b><\/p>\n
Find the LCM of the first two numbers. Now, find the LCM of the result obtained and the third number.<\/span><\/p>\n
Example:\u00a0 We will find the LCM of 6, 10, 12<\/strong><\/span><\/p>\n
First, find the LCM of the first two numbers 6, and 10, by any method explained above, and we will get 30.<\/span><\/p>\n
Now find the LCM of 30 and the third number 12, which will be 60.<\/span><\/p>\n
<\/span><\/p>\n
Examples<\/b><\/h2>\n
<\/b><\/p>\n
1. Find the LCM of 8, 12 and 30 using the division method.\u00a0<\/span><\/h3>\n
Solution:<\/strong>\u00a0<\/span><\/p>\n
![\"\"](\"https:\/\/eistudymaterial.s3.amazonaws.com\/lcm-of-three-numbers-03.png\")
<\/span><\/p>\nAfter solving by division method, LCM = 2 \u00d7 2 \u00d7 2 \u00d7 3 \u00d7 5 = 120.<\/span><\/p>\n
<\/p>\n
2. Find the LCM of 6, 8 and 21 using the prime factorization method.<\/h3>\n
Solution: <\/strong>Prime factorization of each number –\u00a0<\/span><\/p>\n
6 = 2 <\/span>\u00d7 3<\/span><\/p>\n
8 = 2 <\/span>\u00d7 2 \u00d7 2<\/span><\/p>\n
21 = 3 <\/span>\u00d7 7<\/span><\/p>\n
Multiplying all the prime numbers as each occurs most often, we take: <\/span><\/p>\n
2 <\/span>\u00d7 2 \u00d7 2 \u00d7 3 \u00d7 7 = 168<\/span><\/p>\n
So, the required LCM = 168.<\/span><\/p>\n
[\/et_pb_text][\/et_pb_column][et_pb_column type=”2_5″ module_id=”stickysideR” admin_label=”Column R” _builder_version=”4.10.4″ _module_preset=”default” background_color=”#fdefe0″ custom_padding=”25px|25px|25px|25px|true|true” sticky_position=”top” sticky_offset_top=”-280px” sticky_limit_top=”row” sticky_limit_bottom=”row” sticky_position_tablet=”none” sticky_position_phone=”none” sticky_position_last_edited=”on|desktop” sticky_limit_bottom_tablet=”” sticky_limit_bottom_phone=”” sticky_limit_bottom_last_edited=”on|phone” border_radii=”on|15px|15px|15px|15px” box_shadow_style=”preset3″ global_colors_info=”{}”][et_pb_image src=”https:\/\/eistudymaterial.s3.amazonaws.com\/1080×1080.png” alt=”Free Trial banner” title_text=”Mindspark Free Trial Banner” url=”https:\/\/mindspark.in\/free-trial” align=”center” module_class=”adsimg” _builder_version=”4.11.1″ _module_preset=”default” custom_padding=”||||false|false” border_radii=”on|10px|10px|10px|10px” global_colors_info=”{}” transform_styles__hover_enabled=”on|hover” transform_scale__hover_enabled=”on|hover” transform_translate__hover_enabled=”on|desktop” transform_rotate__hover_enabled=”on|desktop” transform_skew__hover_enabled=”on|desktop” transform_origin__hover_enabled=”on|desktop” transform_scale__hover=”102%|102%”][\/et_pb_image][et_pb_text admin_label=”Explore Other Topics
\n” _builder_version=”4.9.11″ _module_preset=”default” header_font=”|700|||||||” header_font_size=”25px” text_orientation=”center” custom_margin=”0px||0px||true|false” custom_padding=”8px|15px|0px|15px|false|true” locked=”off” global_colors_info=”{}”]<\/p>\nExplore Other Topics<\/h1>\n
[\/et_pb_text][et_pb_text _builder_version=”4.10.7″ _module_preset=”default” text_line_height=”2.2em” link_font_size=”16px” custom_margin=”||0px||false|false” custom_padding=”10px|15px|10px|28px|true|false” locked=”off” global_colors_info=”{}”]<\/p>\n
\nGeometry<\/a><\/div>\nTrigonometry<\/a><\/div>\nOperations<\/a><\/div>\nNumbers<\/a><\/div>\n<\/div>\n[\/et_pb_text][et_pb_text admin_label=”Related Concepts
\n” _builder_version=”4.9.11″ _module_preset=”default” header_font=”|700|||||||” header_font_size=”25px” text_orientation=”center” custom_margin=”0px||0px||true|false” custom_padding=”8px|15px|0px|15px|false|true” locked=”off” global_colors_info=”{}”]<\/p>\nRelated Concepts<\/h1>\n
[\/et_pb_text][et_pb_text _builder_version=”4.13.1″ _module_preset=”default” text_line_height=”2.2em” link_font_size=”16px” custom_margin=”||0px||false|false” custom_padding=”10px|15px|10px|28px|true|false” locked=”off” global_colors_info=”{}”]<\/p>\n
\nLCM of two numbers<\/a><\/div>\nRelation between HCF and LCM<\/a><\/div>\n - Prime Factorization<\/span><\/li>\n