Respuesta :

VictorZ
Hi.

Firstly, factorise the given numbers :

☆ 10 = 2 × 5 

☆ 5 = [tex]5^{1}[/tex]

☆ 13 = [tex]13^{1}[/tex]

Then, count the number of times each prime factor appears in the factorization of all :

L.C.M = 2 × 5 × 13 = 130

Hence

[tex]\boxed{\sf L.C.M = 130}[/tex]

Thanks!
nalicia
The answer is C. 130

Otras preguntas