An exercise on polyglossy: the same problem solved on multiple languages

commit b90941c3c6ffccc5ec427b1faac3a00ebbfe075c
parent e0fabdc076fef3fdc0be21791770920f928d7cc2
Author: Pablo Emilio Escobar Gaviria <pablo-escobar@riseup.net>
Date:   Sat, 15 Aug 2020 13:31:16 -0300

Cleaned some latex code

MREADME.adoc | 2+-
1 file changed, 1 insertion(+), 1 deletion(-)
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$].