Talk:Greatest common divisor: Difference between revisions

Talk:Greatest common divisor (view source)

Revision as of 16:10, 17 August 2012

262 bytes added , 11 years ago

m

→‎errors in programs: added Wikipedia citation of defintion of gcd(0,0)=0. -- ~~~~

Anonymous user

rosettacode>Gerard Schildberger

Revision as of 15:39, 17 August 2012 (view source) rosettacode>Gerard Schildberger (→‎errors in programs: added sigline to previous statements, added comments about gcd(0,0). -- ~~~~) ← Older edit		Revision as of 16:10, 17 August 2012 (view source) rosettacode>Gerard Schildberger m (→‎errors in programs: added Wikipedia citation of defintion of gcd(0,0)=0. -- ~~~~) Newer edit →
Line 6: ::unless it is 0 --[[User:Walterpachl\|Walterpachl]] 12:40, 17 August 2012 (UTC) ----- ::: The special case of '''gcd(0,0)''' is usually defined to be '''0''', but some authors consider it to be '''undefined'''. When implementing the REXX version 1 example, the first definition (0) was chosen. So, for that case, '''\|0\| = 0'''. -- [[User:Gerard Schildberger\|Gerard Schildberger]] 15:39, 17 August 2012 (UTC) ▼ ▲~~:::~~ The special case of '''gcd(0,0)''' is usually defined to be '''0''', but some authors consider it to be '''undefined'''. When implementing the REXX version 1 example, the first definition (0equal to zero) was chosen. So, for that case, '''\|0\| = 0'''. ~~-- [[User:Gerard Schildberger\|Gerard Schildberger]] 15:39, 17 August 2012 (UTC)~~ From the Wikipedia page: http://en.wikipedia.org/wiki/Greatest_common_divisor It is useful to define gcd(0,0)=0 and lcm(0,0)=0 because then the natural numbers become a complete distributive lattice with gcd as meet and lcm as join operation. -- [[User:Gerard Schildberger\|Gerard Schildberger]] 16:10, 17 August 2012 (UTC) <br><br>A number of examples don't show the results if either argument is negative. -- [[User:Gerard Schildberger\|Gerard Schildberger]] 15:39, 17 August 2012 (UTC)