Modular Reverse Recursion Sequence
Given any number n > 0, let r represent the reverse of the number n. Iterate until the final result is zero, passing the result of each iteration back into the function using recursion or a methodology of your choice by performing the below operation:
If r > ...
Ruby, 60 bytes - first attempt
%w(f21c 49a7 856b 3ed0).map{|i|i.chars.map{|i|i.to_i(16)+1}}
Ruby, 45 bytes - cheap
puts '16,3,2,13|5,10,11,8|9,6,7,12|4,15,14,1'
-15
As shown by a recent challenge, once a few people have downvoted a question (say, three or four) everyone else thinks that they should downvote too leading to incredibly low scores.
I think we need a reform on how we downvote and/or what we downvote on. This will stop people from becoming dishea...
