Source

euler / clojure / problem16.clj

Full commit
;; problem16
;; John Paulett - June 8, 2009
;;
;; 2^(15) = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
;; What is the sum of the digits of the number 2^(1000)?
(use '[clojure.contrib.math :only (expt)])
(use '[util :only (sum-digits)])

(defn sum-exp-digits [base exp]
	(sum-digits (expt base exp)))

	
;; tests
(assert (= 26 (sum-exp-digits 2 15)))

(println (sum-exp-digits 2 1000))
;; 1366