Difference between revisions of "Manuals/calci/GCD"
Jump to navigation
Jump to search
| Line 48: | Line 48: | ||
|class="sshl_f" |2 | |class="sshl_f" |2 | ||
|} | |} | ||
| + | |||
| + | == See Also == | ||
| + | |||
| + | *[[Manuals/calci/LCM | LCM]] | ||
| + | |||
| + | ==References== | ||
| + | |||
| + | *[http://en.wikipedia.org/wiki/Greatest_common_divisor Greatest Common Divisor] | ||
Revision as of 06:33, 20 November 2013
=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(5,10) returns 5
- 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 |