On branch euler2

Changes to be committed:
	modified:   euler2.scm
 - Working in modulo, debugging x/2 tricks

euler2.scm

@@ -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)
+                      (define even_total 0)
                       (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))))))
+                         (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)))