<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://mw.lojban.org/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Xalbo</id>
	<title>Lojban - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://mw.lojban.org/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Xalbo"/>
	<link rel="alternate" type="text/html" href="https://mw.lojban.org/papri/Special:Contributions/Xalbo"/>
	<updated>2026-10-22T14:55:23Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.46.2</generator>
	<entry>
		<id>https://mw.lojban.org/index.php?title=fancylojban_challenges&amp;diff=116471</id>
		<title>fancylojban challenges</title>
		<link rel="alternate" type="text/html" href="https://mw.lojban.org/index.php?title=fancylojban_challenges&amp;diff=116471"/>
		<updated>2015-07-21T17:17:38Z</updated>

		<summary type="html">&lt;p&gt;Xalbo: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Lojban is supposed to be a logical language, so why not practice translating some common mathematical statements, or algorithms&lt;br /&gt;
&lt;br /&gt;
Additional challenge: Don&#039;t use mekso with VUhU. Or use them, if you prefer the challenge of wrangling with mekso grammar...&lt;br /&gt;
&lt;br /&gt;
== Fermat&#039;s Last Theorem ==&lt;br /&gt;
&lt;br /&gt;
(The statement, not the proof, of course!)&lt;br /&gt;
&lt;br /&gt;
&amp;quot;No three positive integers &#039;&#039;a&#039;&#039;, &#039;&#039;b&#039;&#039;, and &#039;&#039;c&#039;&#039; can satisfy the equation &#039;&#039;a&#039;&#039;&amp;lt;sup&amp;gt;&#039;&#039;n&#039;&#039;&amp;lt;/sup&amp;gt;&amp;amp;nbsp;+&amp;amp;nbsp;&#039;&#039;b&#039;&#039;&amp;lt;sup&amp;gt;&#039;&#039;n&#039;&#039;&amp;lt;/sup&amp;gt;&amp;amp;nbsp;=&amp;amp;nbsp;&#039;&#039;c&#039;&#039;&amp;lt;sup&amp;gt;&#039;&#039;n&#039;&#039;&amp;lt;/sup&amp;gt; for any integer value of &#039;&#039;n&#039;&#039; greater than two.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Subproblem #1: How to explicitly make letter pronouns or ko&#039;a-series existential, without having to assign {daxivo goi ny} e.g.?&lt;br /&gt;
&lt;br /&gt;
[http://pastebin.com/gzT8X9vj Solution] by [[User:Spheniscine|la zipcpi]] (doesn&#039;t solve subproblem #1)&lt;br /&gt;
&lt;br /&gt;
== Euclid&#039;s Algorithm for Greatest Common Divisor ==&lt;br /&gt;
&lt;br /&gt;
 &#039;&#039;&#039;function&#039;&#039;&#039; gcd(a, b)&lt;br /&gt;
     &#039;&#039;&#039;if&#039;&#039;&#039; b = 0&lt;br /&gt;
        &#039;&#039;&#039;return&#039;&#039;&#039; a&lt;br /&gt;
     &#039;&#039;&#039;else&#039;&#039;&#039;&lt;br /&gt;
        &#039;&#039;&#039;return&#039;&#039;&#039; gcd(b, a &#039;&#039;&#039;mod&#039;&#039;&#039; b)&lt;br /&gt;
&lt;br /&gt;
Also try a non-recursive version, but we&#039;d probably need a new brivla for while-loop, and {tu&#039;e...tu&#039;u} in NU.&lt;br /&gt;
&lt;br /&gt;
Subproblem #1: come up with a better brivla to define than one based on the abbreviation &amp;quot;gcd&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Recursive [http://pastebin.com/F9795SdM solution] by [[User:Spheniscine|la zipcpi]] (doesn&#039;t solve subproblem #1)&lt;br /&gt;
&lt;br /&gt;
== Towers of Hanoi ==&lt;br /&gt;
&lt;br /&gt;
x1 is the sequence of moves that move discs from x2 to x3 using x4 as temporary storage.&lt;br /&gt;
&lt;br /&gt;
Recursive [http://pastebin.com/QKseQhYa solution] by [[User:xalbo|la xalbo]]&lt;br /&gt;
&lt;br /&gt;
== While-loop brivla - English and Lojban definitions ==&lt;br /&gt;
&lt;br /&gt;
In the vein of &#039;&#039;&#039;ifle&#039;&#039;&#039;, we might need brivla suitable for describing while-loops...&lt;br /&gt;
&lt;br /&gt;
While-loop:&lt;br /&gt;
&lt;br /&gt;
As long as x1 (du&#039;u proposition) is true, x2 (action/event) repeatedly happens&lt;br /&gt;
&lt;br /&gt;
Do-while-loop:&lt;br /&gt;
&lt;br /&gt;
x1 (action/event) happens, then repeats as long as x2 (du&#039;u proposition) is true.&lt;br /&gt;
&lt;br /&gt;
With &#039;&#039;&#039;ko&#039;oi&#039;&#039;&#039; / &#039;&#039;&#039;gau ko&#039;&#039;&#039; / &#039;&#039;&#039;ko gasnu lo nu&#039;&#039;&#039; turning it into a command that the agent (whether it&#039;s a computer or a person) should follow.&lt;br /&gt;
&lt;br /&gt;
Question: Can Lojban, as designed, actually handle this? Can KOhA and letteral variables be reinterpreted in an existing du&#039;u-proposition, or does the proposition remain the same even if the variables get goi-ed to something else?&lt;br /&gt;
&lt;br /&gt;
== Informal algorithms ==&lt;br /&gt;
&lt;br /&gt;
Instructional texts like cookbooks or game rules, that might have use for certain programming-language-like structures, but which might not need to be specified to the last detail like programming languages...&lt;/div&gt;</summary>
		<author><name>Xalbo</name></author>
	</entry>
</feed>