a-conjecture-of-mine

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

git clone: git://git.pablopie.xyz/a-conjecture-of-mine
Log
Files
Refs

Commit: f75107bb25560e88634360c536e8feee42aa9670
Parent: 4db9a614662adf9d05e58ee89562bcf700cbe087
Author: Pablo Escobar Gaviria <gark.garcia@protonmail.com>
Date: Tue, 4 Feb 2020 10:48:49 -0200

Minor adjustments.

Diffstat

2 files changed, 3 insertions, 3 deletions

Status	File Name	N° Changes	Insertions	Deletions
Modified	script.js	2	1	1
Modified	script.rkt	4	2	2

diff --git a/script.js b/script.js
@@ -23,7 +23,7 @@ function getSums(max) {
     return output;
 }
 
-export function getCounterExp(max) {
+export function counterexempl(max) {
     const sums = getSums(max);
 
     for (let a = 1; a <= max; a++)

diff --git a/script.rkt b/script.rkt
@@ -5,11 +5,11 @@
 ; Let S: N -> N be the sum of the digits of a positive integer.
 ; For all A and B in N, S(A + B) = S(A) + S(B) - 9k, where k is an interger.
 
-(provide counterexempl)
+(provide counterexempl?)
 
 ;; Returns `#t` if a counterexemple was found between `0` and `max`.
 ;; Otherwise returns `#f`.
-(define (counterexempl max)
+(define (counterexempl? max)
     (let ([sums-cache (get-sums max)])
          (not (stream-fold (lambda (acc a) (and acc (iter a sums-cache)))
                            #t