1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 | (define (isPrime? p) (if (= p 1) #t (non-divisible-by p 2))) (define (non-divisible-by n d) (if (> d (sqrt n)) #t (if (= (remainder n d) 0) #f (non-divisible-by n (+ d 1))))) (define (hp x) (primeFactor? x 2)) (define (primeFactor? x i) (if (= 0 (- (/ x i) (floor (/ x i)))) (if (isPrime? (/ x i)) (/ x i) (primeFactor? x (+ i 1))) (primeFactor? x (+ i 1)))) (define (foo x i) (- (/ x i) (floor (/ x i)))) ;;;;;;;;find 1001th prime: (define (nthPrime x) (XnthPrime 2 1 x)) (define (nextPrime x) (if (isPrime? (+ x 1)) (+ x 1) (nextPrime (+ x 1)))) (define (XnthPrime x i j) (if (= i j) x (XnthPrime (nextPrime x) (+ i 1) j))) |
-
upload with new input
-
result: Success time: 0.03s memory: 4176 kB returned value: 0
(foo 12 5)
-
result: Success time: 0.02s memory: 4176 kB returned value: 0
(foo 3 4)
-
result: Success time: 0.03s memory: 4176 kB returned value: 0
(nextPrime 10)
-
result: Success time: 0.02s memory: 4176 kB returned value: 0
(nthPrime 1001)
-
result: Success time: 0.02s memory: 4176 kB returned value: 0
(xthPrime 1001)



