seasharp/euler-problems_gerbil-scheme
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

On branch euler2

Browse Source 
Changes to be committed:
	modified:   euler2.scm
 - Working in modulo, debugging x/2 tricks
This commit is contained in:
seasharp 2022-08-26 09:45:42 -04:00
parent 238e68b81a
commit 77dd1b8779
1 changed files with 10 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
euler2.scm
View File

@ -8,13 +8,18 @@
;;1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
;;
;;By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
; (println (string-append (number->string current) " % 2 = 0 is: " (if (eqv? (modulo current 2) 0) "#t" "#f")))
; (println (string-append (number->string current) " % 2 is: " (number->string (modulo current 2))))
(define increment (lambda (current next largest)
(if (eqv? largest 0)
(println current)
(begin
(println (string-append "current is: " (number->string current) "next is: " (number->string next) "largest is: " (number->string largest)))
(increment next (+ current next) (- largest 1))))))
(define even_total 0)
(if (eqv? largest 0)
(println (string-append "RETURN " (number->string even_total)))
(lambda ()
((println "In lambda.")
(if (eqv? (modulo current 2) 0)
(+ even_total current))
(increment next (+ current next) (- largest 1)))))))
(define fibbonacci (lambda (integer) (increment 1 2 integer)))