213

edits
# Changes

m

no edit summary

For the purposes of this article: All expressions are big-endian and microdigits are in traditional decimal. PEMDAS is obeyed.

== Mode Activation ==

== Original Explanation ==

Let <math>z = a_0 + b_0/(a_1 + b_1/(a_2 + b_2/(\dots))) = a_0 + \underset{i=0}{\overset{\infty}{\mathrm K}} \big(\frac{b_i}{a_{i+1}}\big)</math>, where <math>a_i</math> and <math>b_i</math> are integers for all <math>i</math> (see [https://oeis.org/wiki/Continued_fractions#Gauss.27_Kettenbruch_notation Kettenbruch notation here]). In fact, for all i, we will canonically restrict <math>a_{(i+1)}</math> and <math>b_i</math> to nonnegative integers such that if <math>b_j = 0</math>, then <math>a_k = 1</math> and <math>b_k = 0</math> for all <math>k \geq j</math>; this is a perfectly natural and standard set of restrictions to make and does not actually diminish the set of numbers which are expressible in this format, but the restriction is not technically necessary for Lojban. Then we will denote <math>z</math> by the continued fraction representation <math>z = (a_0 : b_0, a_1 : b_1, a_2 : b_2, \dots)</math>; the whole rhs representation is called a string. Notice that the integer part is included. In this format, for each <math>i</math>, "<math>a_i : b_i</math>" forms a single unit called a macrodigit; for each <math>i</math>, "<math>a_i</math>" and "<math>b_i</math>" each are microdigits; the colon ("<math>:</math>") separates microdigits and the comma ("<math>,</math>") separates macrodigits. Microdigits can be expressed in any base or other representation and macrodigits could be reversed or slightly rearranged (such as being of form "<math>b_i : a_{(i+1)}</math>"; however, for our purposes here microdigits will be expressed in big-endian traditional decimal and macrodigits will be formed and ordered as shown; the specification herein proposed will obligate the user to express the macrodigits in the form which is shown (id est: of form "<math>a_i : b_i</math>"; within any given macrodigit, the first microdigit expressed represents <math>a_i</math> and the second (and final) microdigit expressed represents <math>b_i</math>, only) but the other features aforementioned are not guaranteed, although they may normally be assumed as a contextless default. In order to be clear: in this representation, each macrodigit will consist of exactly two microdigits - namely, <math>a_i</math> and <math>b_i</math> in that order, for all <math>i</math> - and these microdigits will be separated explicitly by "pi'e"; meanwhile, macrodigits will be separated explicitly by "pi". In this representation, I will denote a not-explicitly-specified microdigit by a pair of consecutive underscores ("<math>\_\_</math>"). In the 'big-endian' arrangement of the macrodigits (as herein depicted), the first microdigit (<math>a_0</math>) represents the 'integer part' of the expression.

In this system, let "pi'e" represent ":" and let "pi" represent ",", each bijectively. Then the basic method of expressing a continued fraction is to just read <math>(a_0 : b_0, a_1 : b_1, a_2 : b_2, \dots)</math> where each microdigit is expressed in some base which represents integers, the parenthesis are not mentioned, the separators being named/pronounced as before, "ra'e" being used in order to create cyclic patterns or to extend the string indefinitely, and the string being terminated as any numeral string could or would be. The interpretation of the whole string according to these rules for continued fractions would be specified via JUhAU.

The string will terminate and be interpreted as a number formed from the specified continued fraction as all other digits strings do (see my other work).

-- [[User:Krtisfranks|Krtisfranks]] ([[User talk:Krtisfranks|talk]]) 08:10, 9 March 2018 (UTC)

== Alternative Explanation ==

The description in this section is intended to provide the same results as those in the "Original Explanation" section.

Zeroth, the mode must be activated (as described previously).

=== Step 1: Simplest (and Finite) Case ===

Let <math>n \in \mathbb{N} \cup \{0\}</math>. Consider the continued fraction <math>a_0 + \underset{i=0}{\overset{n}{\mathrm K}} \big(\frac{b_i}{a_{i+1}}\big)</math>, where <math>\forall i, a_i</math> & <math>b_i</math> will be explicitly defined, particularly as they arise. We can enforce conditions on the sequences <math>(a_i)_i</math> & <math>(b_i)_i</math>, but we will ignore such details, because we just need formal continued fractions.