Difference between revisions of "Manuals/calci/GCD"
Jump to navigation
Jump to search
| Line 54: | Line 54: | ||
|class="sshl_f" |2 | |class="sshl_f" |2 | ||
|} | |} | ||
| + | |||
| + | ==Related Videos== | ||
| + | |||
| + | {{#ev:youtube|jFd-6EPfnec|280|center|GCD}} | ||
== See Also == | == See Also == | ||
Revision as of 15:45, 17 April 2015
GCD(number1, number2, .....)
- Where 'number1, number2, ......' are integer values.
GCD() calculates the 'Greatest Common Divisor' of two or more integers.
Description
GCD(number1, number2, .....)
For Example,
GCD(25,100) returns 25
The divisors for '25' are 1,5,5.
The divisors for '100' are 1,2,2,5,5.
So, common divisors are 1,5,5. Hence the GCD(25,100) is '25'.
- GCD value is the largest interger that divides the input numbers without a remainder.
- If any 'number' is nonnumeric, Calci displays an #ERROR message.
- If any 'number' is negative, Calci displays an #ERROR message.
- For only one 'number' is entered, Calci assumes the second number to be '0'.
- If any 'number' is not an integer, it is truncated.
Examples
| Function | GCD Output |
| GCD(48,64) | 16 |
| GCD(125,0) | 125 |
| GCD(125,5) | 5 |
| GCD(125,5.5) | 5 |
| GCD(0.8,2) | 2 |