fancylojban challenges: Difference between revisions
Jump to navigation
Jump to search
Spheniscine (talk | contribs) No edit summary |
Spheniscine (talk | contribs) No edit summary |
||
Line 1: | Line 1: | ||
Lojban is supposed to be a logical language, so why not practice translating some common mathematical statements, or algorithms | Lojban is supposed to be a logical language, so why not practice translating some common mathematical statements, or algorithms | ||
Additional challenge: Don't use mekso with VUhU. Or use them, if prefer the challenge of wrangling with mekso grammar... | Additional challenge: Don't use mekso with VUhU. Or use them, if you prefer the challenge of wrangling with mekso grammar... | ||
== Fermat's Last Theorem == | == Fermat's Last Theorem == |
Revision as of 05:16, 21 July 2015
Lojban is supposed to be a logical language, so why not practice translating some common mathematical statements, or algorithms
Additional challenge: Don't use mekso with VUhU. Or use them, if you prefer the challenge of wrangling with mekso grammar...
Fermat's Last Theorem
(The statement, not the proof, of course!)
"No three positive integers a, b, and c can satisfy the equation an + bn = cn for any integer value of n greater than two."
Euclid's Algorithm for Greatest Common Divisor
function gcd(a, b) if b = 0 return a else return gcd(b, a mod b)
Also try a non-recursive version, but we'd probably need a new brivla for while-loop, and {tu'e...tu'u} in NU