Return to Answer

deleted 81 characters in body

edited Jun 3, 2017 at 17:00

53.2k
5
44
164

05AB1E, 118 bytes

µNÈNNÑ¨OQP½µNNÑ¨OQ½

Try it online!

Explanation

µ  # loop over increasing N until counter equals input NÈ # push N is even   N # push N   NÑ # push factors of N   ¨ # remove last factor (itself)   O # sum factors   Q # sum(factors(N)) == N  compare the Psum to N #for productequality   ½  # if true, increase counter

05AB1E, 11 bytes

µNÈNNÑ¨OQP½

Try it online!

Explanation

µ  # loop over increasing N until counter equals input NÈ # push N is even   N # push N   NÑ # push factors of N   ¨ # remove last factor (itself)   O # sum factors   Q # sum(factors(N)) == N  P # product   ½ # if true, increase counter

05AB1E, 8 bytes

µNNÑ¨OQ½

Try it online!

Explanation

µ # loop over increasing N until counter equals input N # push N NÑ # push factors of N ¨ # remove last factor (itself) O # sum factors Q # compare the sum to N for equality ½  # if true, increase counter

Source Link

answered Jun 3, 2017 at 16:30

Emigna

53.2k
5
44
164

05AB1E, 11 bytes

µNÈNNÑ¨OQP½

Try it online!

Explanation

µ # loop over increasing N until counter equals input NÈ # push N is even N # push N NÑ # push factors of N ¨ # remove last factor (itself) O # sum factors Q # sum(factors(N)) == N P # product ½ # if true, increase counter