# Greatest Common Divisor (GCD) of 1, 3, and 2

In this article we will calculate and work out the Greatest Common Divisor (GCD) of the numbers 1, 3, and 2.

The GCD of 1, 3, and 2 is the largest positive integer (a whole number with no decimal) that can be divided evenly into all of the numbers in the set.

You might have seen this called the Greatest Common Factor (GCF) or the Highest Common Factor (HCF). They all mean the same thing.

If you are calculating the Greatest Common Divisor of 1, 3, and 2 yourself, the easiest way to do that might be to actually list out all of the divisors for each number and then find out what the greatest common divisor is.

For 1, 3, and 2 those divisors look like this:

- Divisors for 1:
**1** - Divisors for 3:
**1**and 3 - Divisors for 2:
**1**and 2

As you can see when you list out the divisors of each number, 1 is the greatest number that 1, 3, and 2 divides into.

When working with larger numbers, though, listing through all of the divisors will take a lot of computer processing power.

When working with larger numbers, or even with smaller numbers when you want to find the Greatest Common Divisor of 1, 3, and 2 in the most efficient way possible, we would use Prime Factors.

A Prime Number is one that is divisible only by itself and the number 1. And so a Prime Factor is a Prime Number which is also a Factor of 1, 3, and 2.

The algorithm I use for this is much more efficient because there are far less Prime Factors in 1, 3, and 2.

For 1, 3, and 2 the Prime Factors are:

- Prime Factors for 1:
- Prime Factors for 3: 3
- Prime Factors for 2: 2

You can see again from the bolded number 1 that the Greatest Common Divisor of 1, 3, and 2 is 1.

GCD(1,3,2) = 1

Hopefully I have been able to explain the GCD of 1, 3, and 2 and given you some information that you can use to try this for yourself and calculate the Greatest Common Divisor of a new set of numbers.

### Link To or Reference This Page

If you found this content useful in your research, please do us a great favor and use the tool below to make sure you properly reference us wherever you use it. We really appreciate your support!

<a href="https://divisiblebot.com/greatest-common-divisor/1-3-2/">Greatest Common Divisor (GCD) of 1, 3, and 2</a>

"Greatest Common Divisor (GCD) of 1, 3, and 2".

*DivisibleBot.com*. Accessed on October 26, 2021. https://divisiblebot.com/greatest-common-divisor/1-3-2/."Greatest Common Divisor (GCD) of 1, 3, and 2".

*DivisibleBot.com*, https://divisiblebot.com/greatest-common-divisor/1-3-2/. Accessed 26 October, 2021.Greatest Common Divisor (GCD) of 1, 3, and 2. DivisibleBot.com. Retrieved from https://divisiblebot.com/greatest-common-divisor/1-3-2/.

## Calculate Another Problem

## Sample Calculations

Here are some sample calculations for you:

## Random Calculations

Here are some more random calculations for you: