Difference between revisions of "Documentation/How Tos/Calc: GCD ADD function"
From Apache OpenOffice Wiki
< Documentation | How Tos
OOoWikiBot (Talk | contribs) m (Robot: Automated text replacement %s) |
OOoWikiBot (Talk | contribs) m (Robot: Automated text replacement %s) |
||
| Line 25: | Line 25: | ||
* [[Documentation/How_Tos/Calc: GCD function|GCD]] | * [[Documentation/How_Tos/Calc: GCD function|GCD]] | ||
* [[Documentation/How_Tos/Calc: LCM function|LCM]] | * [[Documentation/How_Tos/Calc: LCM function|LCM]] | ||
| − | * [[Documentation/How_Tos/Calc: LCM_ADD function|LCM_ADD]] | + | * [[Documentation/How_Tos/Calc: LCM_ADD function|LCM_ADD]] |
| − | * [[Documentation/How_Tos/Calc: Mathematical functions|Mathematical functions]] | + | * [[Documentation/How_Tos/Calc: Mathematical functions|Mathematical functions]] |
* [[Documentation/How_Tos/Calc: Functions listed alphabetically|Functions listed alphabetically]] | * [[Documentation/How_Tos/Calc: Functions listed alphabetically|Functions listed alphabetically]] | ||
Revision as of 14:10, 26 February 2009
GCD_ADD
Returns the greatest common divisor of two or more integers.
This function is only available if the Analysis AddIn is installed.
Syntax:
GCD_ADD(integer1; integer2; ... integer30)
- integer1 to integer30 are up to 30 integers or ranges of integers whose greatest common divisor is to be calculated.
- The greatest common divisor (or highest common factor) is the largest positive integer which will divide, without remainder, each of the given integers.
Example:
GCD_ADD(16; 32; 24)
- returns 8, because 8 is the largest number that can divide 16, 24 and 32 without a remainder.
GCD_ADD(B1:B3)
- where cells B1, B2, and B3 contain 9, 12, and 6 returns 3.
GCD_ADD(3; 5)
- returns 1.
Template:Documentation/SeeAlso
Issues:
The ODFF international standardisation of the GCD / GCD_ADD functions will allow both functions to produce precisely the same results.
