ClojureClojure, 131127 bytes
(defn f[n](reduce +(filter #(zero?(rem n %))(range 1(inc n)))))
(defn e[n](loop[i 1 n n](if(>(f i)n){i,(f i)}(recur(inc i)n))))
First try at codegolfing, any tips are welcomeTry it online!
(defn f[n](reduce +(filter #(zero? (rem n %))(range 1(inc n)))))
(defn e[n](loop[i 1 n n](if(>(f i) n){i,(f i)}(recur(inc i) n))))
Try it online! thanks to @steadybox for -4 bytes!
Clojure, 131 bytes
First try at codegolfing, any tips are welcome
(defn f[n](reduce +(filter #(zero? (rem n %))(range 1(inc n)))))
(defn e[n](loop[i 1 n n](if(>(f i) n){i,(f i)}(recur(inc i) n))))
Clojure, 127 bytes
(defn f[n](reduce +(filter #(zero?(rem n %))(range 1(inc n)))))
(defn e[n](loop[i 1 n n](if(>(f i)n){i,(f i)}(recur(inc i)n))))
thanks to @steadybox for -4 bytes!
caird coinheringaahing ♦
- 50.9k
- 11
- 133
- 364
Clojure, 131 bytes
Clojure, 131 bytes
First try at codegolfing, any tips are welcome
(defn f[n](reduce +(filter #(zero? (rem n %))(range 1(inc n)))))
(defn e[n](loop[i 1 n n](if(>(f i) n){i,(f i)}(recur(inc i) n))))
Clojure, 131 bytes
First try at codegolfing, any tips are welcome
(defn f[n](reduce +(filter #(zero? (rem n %))(range 1(inc n)))))
(defn e[n](loop[i 1 n n](if(>(f i) n){i,(f i)}(recur(inc i) n))))
Clojure, 131 bytes
First try at codegolfing, any tips are welcome
(defn f[n](reduce +(filter #(zero? (rem n %))(range 1(inc n)))))
(defn e[n](loop[i 1 n n](if(>(f i) n){i,(f i)}(recur(inc i) n))))
Clojure, 131 bytes
First try at codegolfing, any tips are welcome
(defn f[n](reduce +(filter #(zero? (rem n %))(range 1(inc n)))))
(defn e[n](loop[i 1 n n](if(>(f i) n){i,(f i)}(recur(inc i) n))))