(let* ((ps (list 2 3 5 7 11 13))(pp (apply * ps))(pt (fileVal "Miller-Rabin")))
  (lambda (a b) (let ((g (gcd a b)) (g1 (gcd (+ a a 1)(+ b b))) (n (modulo b pp))
     (rg (((fileVal "RC4") 'rbi "a seEd of sorts") (- a 3))))
   (cond ((> g 1) (list "Always divisible by" g))
   ((> g1 1) (list "2(a+nb) + 1 always divisible by" g1))
     (#t (let more ((a a)(m (modulo a pp))(cn 0))
    (if (and (let all ((l ps))(or (null? l)
      (and (positive? (remainder m (car l))) 
           (positive? (remainder (+ 1 m m) (car l))) (all (cdr l)))))
        (let all ((l 20)) (or (zero? l)
          (let ((p (rg)))
            (and (pt p a) (pt (+ p p) (+ 1 a a))(all (- l 1)))))))
      a
      (begin (display ",")(more (+ a b)(modulo (+ m n) pp)(+ cn 1))))))))))