What is the smallest number that can be divided by 3,9,12 without a remainder

LCM = 36

Step-by-step explanation:

Basically you want to find LCM which is the Least Common Multiple. This is the process of coming up with the smallest positive multiple that is common to two or more numbers.

Look up how to solve using cake ladder method. Basically you are going to list all numbers and use the same number to divide them in whole number without remainder. You do this until you encounter a point where you cannot further divide without remainder. Then you multiply the left most column and last row.

I have listed the process below and answer is 36 (multiply the left most column and last row. )

∠lno ≅ ∠lnm

∠oln ≅ ∠mln

step-by-step explanation:

given   that triangle lno is congruent to triangle lnm.

we have to fill up the blanks in the given question.

according to above order of congruency   kept in mind we can say that

∠lno ≅ ∠lnm

∠oln ≅ ∠mln

ln ≅ ln due to common in both.

hence, by sas congruency,

the side angle side rule   states that if two sides and the included angle of one triangle are congruent to another triangle, then these two triangles are congruent.