- Commit
- b90941c3c6ffccc5ec427b1faac3a00ebbfe075c
- Parent
- e0fabdc076fef3fdc0be21791770920f928d7cc2
- Author
- Pablo Emilio Escobar Gaviria <pablo-escobar@riseup.net>
- Date
Cleaned some latex code
a-conjecture-of-mine
An exercise on polyglossy: the same problem solved on multiple languages
Diffstat
1 file changed, 1 insertion, 1 deletion
| Status | File Name | N° Changes | Insertions | Deletions |
| Modified | README.adoc | 2 | 1 | 1 |
diff --git a/README.adoc b/README.adoc @@ -4,7 +4,7 @@ An exercise on _polyglossy_. The same problem solved on multiple languages. == The Problem - Mathematicians' Version -Let latexmath:[$S : \mathbb{N} \rightarrow \mathbb{N}$] be the sum of the +Let latexmath:[S : \mathbb{N} \rightarrow \mathbb{N}] be the sum of the digits of a natural number. Then latexmath:[$S(n + m) \equiv S(n) + S(m) \; (\textrm{mod} \; 9)$] for all natural numbers latexmath:[$n$] and latexmath:[$m$].