Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
38 lines (30 loc) · 849 Bytes

File metadata and controls

38 lines (30 loc) · 849 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
package java_core;
// Find LCM of two numbers
public class IterativeAssignment7 {
void findLCM(int num1, int num2) {
int smaller;
int larger;
int i = 1;
if (num1 < num2) {
smaller = num1;
larger = num2;
} else {
smaller = num2;
larger = num1;
}
int lcm = 0;
// Continue until a multiple is found that is evenly divisible by both numbers
while (true) {
lcm = larger * i;
if (lcm % smaller == 0) {
break;
}
i++;
}
System.out.println("LCM of " + num1 + " and " + num2 + " is " + lcm);
}
public static void main(String args[]) {
IterativeAssignment7 object = new IterativeAssignment7();
object.findLCM(9, 7);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.