From: "Apache" <apache@digitalkingdom.org>
Date: Sun, 03 Aug 2014 21:46:25 -0700
To: webmaster@lojban.org, curtis289@att.net
Subject: [jvsw] Definition Edited At Word to'ei'au -- By krtisfranks
Bcc: jbovlaste-admin@lojban.org
Message-ID: <53df1021.i+pshEdQuQI7WviF%webmaster@lojban.org>
User-Agent: Heirloom mailx 12.5 7/5/10
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Spam_score: -0.9
X-Spam_score_int: -8
X-Spam_bar: /


In jbovlaste, the user krtisfranks has edited a
definition of "to'ei'au" in the language "English".

Differences:

5,5c5,5
< 		Produces the number of $a$-tuples of strictly positive integers all less than or equal to $b$ that form a coprime $(a+1)$-tuple together with $b$. $J_1=\phi$ where $\phi$ is the Euler totient function.
---
> 		Produces the number of $a$-tuples of strictly positive integers all less than or equal to $b$ that form a coprime $(a+1)$-tuple together with $b$. $J_1=$Phi where Phi is the Euler totient function.


Old Data:

	Definition:
		binary mathematical operator: Jordan totient function $J_a(b)$

	Notes:
		Produces the number of $a$-tuples of strictly positive integers all less than or equal to $b$ that form a coprime $(a+1)$-tuple together with $b$. $J_1=\phi$ where $\phi$ is the Euler totient function.

	Jargon:
		

	Gloss Keywords:
		Word: totient function, In Sense: Jordan's (generalizes Euler's)

	Place Keywords:


New Data:

	Definition:
		binary mathematical operator: Jordan totient function $J_a(b)$

	Notes:
		Produces the number of $a$-tuples of strictly positive integers all less than or equal to $b$ that form a coprime $(a+1)$-tuple together with $b$. $J_1=$Phi where Phi is the Euler totient function.

	Jargon:
		

	Gloss Keywords:
		Word: totient function, In Sense: Jordan's (generalizes Euler's)

	Place Keywords:


You can go to <http://jbovlaste.lojban.org/dict/to'ei'au> to see it.