Greatest common divisor in Prolog
1 2 | gcd(A,0,A) :- !.
gcd(A,B,R) :- T is A mod B, gcd(B,T,R).
|
What is this ?
In mathematics, the greatest common divisor (gcd), sometimes known as the greatest common factor (gcf) or highest common factor (hcf), of two non-zero integers, is the largest positive integer that divides both numbers without remainder.
Menu
Advertisement
Link Love 
Cooking
101 Cookbooks
Simply Recipes
Smitten Kitchen
Environment
Ambio
Arduous
Bioterra
Chile
Green Peace
Green Time
Green as a Thistle
Life Goggles
Little Blog In The Big Woods
My Zero Waste
The Crunchy Chicken
The Healthy Cookie
Tree Hugger
World Changing
Books
Mundo Pessoa
Pó dos Livros
Vivendo com Livros
Music
Pitchfork
Pop Tarts Suck Toasted
Computer Science
0xDE
Heathy Algorithms
In theory
Lambda the Ultimate
Shtetl-Optimized
Timbl's Blog
Politics
31 da Armada
A Causa Foi Modificada
A Origem das Espécies
Abrupto
Blasfémias
Causa Nossa
Cheiro a Pólvora
Estado Civil
Força Interior
Mais Actual
Margens de erro
O Estado do Sítio
O Insurgente
Stallman's political notes
Zero de conduta
Mathematics
Ars Mathematica
Frank Morgan
God Plays Dice
Good Math, Bad Math
Gowers's Weblog
Secret Blogging Seminar
Terry Tao's
The Everything Seminar
The Unapologetic Mathematician
The n-Catergoy Café
Friends
About Intelligence
Blog do Pedro
Com 8 horas de atraso
Daily Bytes
In an Airplane Under the Sea
Kinados on tour
Living in Basel
Memory, Musing, and the Moon
Momentos
O Blog da Mãe
Planeta FEUP
Planeta Gondomar
Quartos Escuros
Tech Ramblings
Terrear
Vinhas de Chaves
Walking Around
Yet Another Blogger
Zsofia Pílhal
Information Technology
Chris Brogan
Frank Wierzbicki's
Groklaw
Guido van Rossum's
Ivar Jacobson's
Joel on Software
Linus' blog
Mark's Blog
Martin Fowler's
Paul Graham: Essays
Planet python
Schneier on Security
Ted Leung on the Air