INFORMATION

GCF CAKE METHOD

The greatest common factor (GCF) of three positive whole numbers is the largest number that divides all these numbers exactly. GCF of three numbers can be found by using the upside-down cake method.

In this method, after we write the given numbers, we seek for the prime numbers that divides all the given numbers exactly. If we find such a prime number, we write it to the left. Then we divide the whole numbers on the right by this prime number and write the results on a new layer. We continue the process until no prime number that divides all the numbers on the right remains.

Product of the prime numbers on the right gives us the GCF. This method is also known as the ladder method.

WHAT IS GCF CALCULATOR - 3 NUMBERS?

3 Input GCF calculator,

• Draws the upside-down cake associated with the given numbers,
• Graphically illustrates the result,
• Computes the GCF and
• Calculates all common factors of the entered numbers.

HOW TO USE GCF CALCULATOR - 3 NUMBERS?

You can use the GCF calculator in two ways.

• USER INPUTS

  

  You can enter three positive whole numbers to the input boxes and click on the "CALCULATE" button. The result and explanations appaer below the calculator

• RANDOM INPUTS

  

  You can click on the DIE ICON next to the input boxes. If you use this property, three random numbers are generated and entered to the calculator, automatically. You can see the result and explanations below the calculator. You can create your own examples and practice using this property.

• CLEARING THE INPUT BOX

  

  To check the GCF of other numbers you can clear the input box by clicking on the CLEAR button under the input box.

• COPYING & DOWNLOADING THE SOLUTION

  • 

    You can copy the generated solution by clicking on the "Copy Text" link, appaers under the solution panel.

  • 

    Even you can download the solution as an image file with .jpg extension if you click on the "Download Solution" link at the bottom of the solution panel. You can share the downloaded image file.