Computer Science, asked by sanjanashetty2344, 7 months ago

Design an algorithm to find the LCM of two numbers

Answers

Answered by aviral008

1

Much more effective way to get the least common multiple of two numbers is to multiply them and divide the result by their greatest common divisor. The greatest common divisor may be computed by the Euclidean algorithm, which is very fast, because it does not require factorization of the given numbers.

Answered by harshita2520

1

Answer:

.........

Explanation:

see on the attachment

Attachments:

Previous Question

Next Question

Similar questions

History, 3 months ago

MCQs the British captured the state of Surat using by which method:- ...

English, 3 months ago

Question. She made a beautiful dog. (a) A beautiful dog was made for her. (b) A beautiful dog was made by she. (c) A beautiful dog was made by her. (d) A beautiful dog is made by her.

Math, 3 months ago

2. Try to draw some of the regular polygons around 24m in circumference and find their shoulder lengths.

Social Sciences, 7 months ago

How was the Mughal architecture similar to the Delhi Sultanate architectural styles ? Please answer me.

Science, 7 months ago

conduction can easily take place in liquid. write true or false...

Physics, 10 months ago

Rain actually falling vertically appears to a running man at an angle of 60° with vertical. If the man reduces his speed to one third the angle with vertical of the rain now appears to him.

Science, 10 months ago

name two common weed which are generally found in wheat field ...

Hindi, 10 months ago

निम्नलिखित पंक्तियों में से यमक अलंकार छाँटकर उनका स्पष्टीकरण लिखिा (क) कनक-कनक ते सौगुनी मादकता अधिकाय। वा खाए बौराए जग, या पाए बौराए।। (ख) माला फेरत जुग गया, मिटा न मनका फेर। कर का मनका डारि कर, मन का मनका फेर।। (ग) वह पाकर एक धोती, प्रतिदिन उसे धोती...