The LCD (least common denominator) is better known more generally as the LCM (least common multiple). The LCM of any two integers, typically denoted LCM (a, b), is the lowest positive integer that is evenly divisible by both integers. That is, LCM (a, b) = c such that c/a = c/b. Division by zero is undefined thus it stands to reason that neither a nor b can be zero. However, many people regard LCM (a, 0) = a to be valid even though it is technically undefined, as is LCM (0, 0). Note that either a or b may be negative but LCM (a, b) must always be positive.
The product of a and b is obviously a common multiple of a and b. However, it is not necessarily the lowest common multiple. For instance, 20 is the product of 2 and 10 and is therefore a common multiple of 2 and 10. However, the lowest common multiple of 2 and 10 is 10 because 10/2 = 5 and 10/10 = 1. From this we can surmise that LCM (a, b) can be no greater than the product of a and b and it cannot be any less than the largest of a and b.
There are several ways to calculate the LCM of two integers, however one of the simplest is by reduction by the greatest common divisor (GCD). That is, GCD (a, b) = c such that a and b are evenly divisible by c. The GCD and LCM are similar types of problem, however the GCD is much easier to calculate and can be implemented efficiently using Euclid's algorithm.
In pseudo-code, we can write the GCD (Euclid) algorithm as follows:
algorithm GCD (a, b) is:
while (a <> b) do
if a > b then a := a - b else b := b - a
end while
return a
From this we can now write the LCM algorithm in terms of the GCD algorithm:
algorithm LCM (a, b) is: return a / GCD (a, b) * b
Note that a * b / GCD (a, b) produces the same result, however it is more efficient to perform the division before the multiplication. This is because a / GCD (a, b) is guaranteed to be an integer that is less than or equal to a and is therefore guaranteed not to overflow. Multiplying that integer by b may still overflow, however the chances of overflow are reduced compared to that of multiplying a and b prior to the division.
int x; //first number int y; //second number int z = x*y;
Or even three. Actually, pseudo-code has no rules.
This smells like homework, so I'll only give you pseudo-code: decimal returnLargest(decimal a, decimal b) is a > b ? then, return a, else, return b;
public class GCD { public static void main(String[] args) { //Example how to use this method System.out.println(GCD(15,50)); } //find the greatest common divisor of two numbers public static int GCD(int a, int b){ if (b == 0) return a; return GCD(b, a % b); } } Hope this help to solve you problem.
Pseudocode is typically only used to describe the solutions to large problems. It is used to make complex things simple. If part of your pseudocode included telling someone to add two numbers, you would simply write: num1 + num2
You need at least two numbers to find an LCD.
the difference between that two words is the spelling, numbers of letters and the first letter in that two particular words
The function of the numbers in question. The process is the same. When comparing two whole numbers, we call it the LCM. When comparing two fractions, we call it the LCD.
int x; //first number int y; //second number int z = x*y;
20 and 24
The LCD for the two numbers is 10
Or even three. Actually, pseudo-code has no rules.
Because these are all prime numbers, the LCD will be 1. It'll also be the GCF.
You need at least two numbers to find something in common.
You need at least two numbers to find something in common.
You need at least two numbers to find something in common.
You need at least two numbers to find something in common.