1.首先,最大公约数利用p和q之间求余,将q赋给p,再将余数 r 赋给q,如此循环下去,当q为0,最终的q即为最大公约数。
2.其次,最小公倍数可以由两个数的乘积除以两个数的最大公约数得到。
java程序如下所示:
1.暴力法:
public void run(){
Scanner sc = new Scanner(System.in);
int a;
int b;
int cur = 1;
while (sc.hasNext()){
a = sc.nextInt();
b = sc.nextInt();
for (int i = 1; i <= Math.min(a,b); i++) {
if(a % i == 0 && b % i == 0){
cur = i;
}
}
System.out.println((a * b) / cur);
cur = 1;
}
}
2.递归法
public static int gcd1(int p, int q){
// 若q为0,则最大公约数为p
if(q == 0) {
return p;
}
int r = p % q;
return gcd1(q, r);
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
System.out.println(Main.gcd1(a,b));
}
3.辗转相除法
public static int gcd2(int p, int q){
int r;
while(q != 0){
r = p % q;
p = q;
q = r;
}
return p;
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
System.out.println(Main.gcd2(a,b));
}
public static int lcm(int p, int q) {
int p1 = p;
int q1 = q;
while (q != 0) {
int r = p % q;
p = q;
q = r;
}
return (p1 * q1) / p;
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
System.out.println(Main.lcm(a,b));
}