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

commit 8261006c52c3fa66ce41d0842591f98e8abd9d96
parent 7012c6ede27418bd590d27c319f4c9bd6119e675
Author: Pablo Emilio Escobar Gaviria <pablo-escobar@riseup.net>
Date:   Sat, 15 Aug 2020 13:34:01 -0300

Fixed titles in README.adoc

MREADME.adoc | 2+-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/README.adoc b/README.adoc
@@ -11,7 +11,7 @@ natural numbers latexmath:[n] and latexmath:[m].
 This conjecture can be generalized for any _positional number system_. 
-== The Problem - Programmers Verison
+== The Problem - Programmers' Verison
 Let `S(n: uint) -> uint` be the sum of the digits of `n` in 
 https://en.wikipedia.org/wiki/Decimal[_base 10_]. Then, for all `a` and `b`