fork(1) download
  1. ; prime palindrome
  2.  
  3. (define (palindrome? n)
  4. (define (rev-digits n)
  5. (let loop ((n n) (sum 0))
  6. (if (zero? n) sum
  7. (loop (quotient n 10)
  8. (+ (* 10 sum) (modulo n 10))))))
  9. (= n (rev-digits n)))
  10.  
  11. (define (prime? n)
  12. (if (even? n) (= n 2)
  13. (let loop ((d 3))
  14. (if (< n (* d d)) #t
  15. (if (zero? (modulo n d)) #f
  16. (loop (+ d 2)))))))
  17.  
  18. (define (pp k)
  19. (let loop ((k k) (n 2) (ns (list)))
  20. (if (zero? k) (reverse ns)
  21. (if (and (prime? n) (palindrome? n))
  22. (loop (- k 1) (+ n 1) (cons n ns))
  23. (loop k (+ n 1) ns)))))
  24.  
  25. (display (pp 100)) (newline)
Success #stdin #stdout 1.08s 8988KB
stdin
Standard input is empty
stdout
(2 3 5 7 11 101 131 151 181 191 313 353 373 383 727 757 787 797 919 929 10301 10501 10601 11311 11411 12421 12721 12821 13331 13831 13931 14341 14741 15451 15551 16061 16361 16561 16661 17471 17971 18181 18481 19391 19891 19991 30103 30203 30403 30703 30803 31013 31513 32323 32423 33533 34543 34843 35053 35153 35353 35753 36263 36563 37273 37573 38083 38183 38783 39293 70207 70507 70607 71317 71917 72227 72727 73037 73237 73637 74047 74747 75557 76367 76667 77377 77477 77977 78487 78787 78887 79397 79697 79997 90709 91019 93139 93239 93739 94049)