Best Answer

Let p1 and p2 be the two prime numbers.

Because they are prime, their divisors are div(p1) = {1,p1} and div(p2) = {1,p2}. So GCD(p1,p2) = Greatest Common Divisor of p1 and p2 =

p1 if p1 equals p2

1 if p1 is different from p2

Q: How do you caluculate the GCD of two prime numbers?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

Any two numbers who are relatively prime will workSo look at 9 and 4. Neither is prime and their GCD is 1.You must need two numbers with NO other factors in common.

Two numbers are relatively prime if their greatest common divisor (GCD) is 1. In other words, there is no positive integer greater than 1 that divides both of the numbers. For example, 7 and 12 are relatively prime, but 10 and 15 are not, as their GCD is 5.

Yes because 1 is a factor of any prime number. In fact, 1 is always the gcd (same as gcf) of any two distinct prime numbers.

If you have the gcd or the LCM of two numbers, call them a and b, you can use the relationship that gcd(a,b) = (a multiplied by b) divided by LCM (a,b) where LCM or gcd (a,b) means the LCM or a and b. This means the gcd multiplied by the LCM is the same as the product of two numbers. Let's assume you have neither. There are several ways to do this. One way to approach both problems at once is to factor each number into primes. You can use these prime factorizations to find both the LCM and gcd To compute the Greatest common divisor, list the common prime factors and raise each to the least multiplicities that occurs among the several whole numbers. To compute the least common multiple, list all prime factors and raise each to the greatest multiplicities that occurs among the several whole numbers.

It is impossible for the product of two prime numbers to be prime. It is impossible for the sum of two prime numbers to be prime as long as one of the numbers isn't 2.

Related questions

Any two numbers who are relatively prime will workSo look at 9 and 4. Neither is prime and their GCD is 1.You must need two numbers with NO other factors in common.

If their greatest common denominator (gcd) is 1, they're relatively prime.

Two numbers are relatively prime if their greatest common divisor (GCD) is 1. In other words, there is no positive integer greater than 1 that divides both of the numbers. For example, 7 and 12 are relatively prime, but 10 and 15 are not, as their GCD is 5.

Yes because 1 is a factor of any prime number. In fact, 1 is always the gcd (same as gcf) of any two distinct prime numbers.

By definition, two numbers say a and b are relatively prime if and only if the gcd (a,b) = 1.The two pairs are (5, 16) and (16, 25).

If you have the gcd or the LCM of two numbers, call them a and b, you can use the relationship that gcd(a,b) = (a multiplied by b) divided by LCM (a,b) where LCM or gcd (a,b) means the LCM or a and b. This means the gcd multiplied by the LCM is the same as the product of two numbers. Let's assume you have neither. There are several ways to do this. One way to approach both problems at once is to factor each number into primes. You can use these prime factorizations to find both the LCM and gcd To compute the Greatest common divisor, list the common prime factors and raise each to the least multiplicities that occurs among the several whole numbers. To compute the least common multiple, list all prime factors and raise each to the greatest multiplicities that occurs among the several whole numbers.

The GCD is 2.

Many numbers could have 18 as their GCD (greatest common demoninator/divisor). for instance, 18 and 36 have 18 as their GCD. In general, if you have 2 numbers who's GCD is 18, then those numbers could be expressed as 18x and 18y such that x and y are relatively prime (share no factors, other than 1).

use slide

pictorial representation of a program is called a flowchart

write a shell program for finding out gcd of three given numbers? write a shell program for finding out gcd of three given numbers? write a shell program for finding out gcd of three given numbers? check bellow link http://bashscript.blogspot.com/2009/08/gcd-of-more-than-two-numbers.html

No two prime numbers can make 30.No two prime numbers can make 30.No two prime numbers can make 30.No two prime numbers can make 30.