; hidden squares (define (take n xs) (let loop ((n n) (xs xs) (ys '())) (if (or (zero? n) (null? xs)) (reverse ys) (loop (- n 1) (cdr xs) (cons (car xs) ys))))) (define (digits n . args) (let ((b (if (null? args) 10 (car args)))) (let loop ((n n) (d '())) (if (zero? n) d (loop (quotient n b) (cons (modulo n b) d)))))) (define (undigits ds . args) (let ((b (if (null? args) 10 (car args)))) (let loop ((ds ds) (n 0)) (if (null? ds) n (loop (cdr ds) (+ (* n b) (car ds))))))) (define (isqrt n) (if (not (and (positive? n) (integer? n))) (error 'isqrt "must be positive integer") (let loop ((x n)) (let ((y (quotient (+ x (quotient n x)) 2))) (if (< y x) (loop y) x))))) (define (unique eql? xs) (cond ((null? xs) '()) ((null? (cdr xs)) xs) ((eql? (car xs) (cadr xs)) (unique eql? (cdr xs))) (else (cons (car xs) (unique eql? (cdr xs)))))) (define (square? n) (let ((s (isqrt n))) (= n (* s s)))) (define (k-squares k ds) (if (< (length ds) k) (list) (let ((n (undigits (take k ds)))) (if (square? n) (cons n (k-squares k (cdr ds))) (k-squares k (cdr ds)))))) (define (hidden-squares n) (let* ((ds (digits n)) (len (length ds))) (let loop ((k 1) (hs (list))) (if (< len k) (unique = (sort hs <)) (loop (+ k 1) (append (k-squares k ds) hs)))))) (display (hidden-squares 1625649)) (newline)