! Copyright (c) 2008 Aaron Schaefer.
! See http://factorcode.org/license.txt for BSD license.
-USING: kernel math math.combinatorics math.parser math.primes
- project-euler.common sequences sets ;
+USING: kernel math math.primes project-euler.common sequences ;
IN: project-euler.035
! http://projecteuler.net/index.php?section=problems&id=35
: possible? ( seq -- ? )
dup length 1 > [
- dup { 0 2 4 5 6 8 } diff =
+ [ even? ] none?
] [
drop t
] if ;
: (circular?) ( seq n -- ? )
dup 0 > [
- 2dup rotate 10 digits>integer
+ 2dup rotate digits>number
prime? [ 1 - (circular?) ] [ 2drop f ] if
] [
2drop t