Find The Divisors! [Codewars Kata] [Ruby]
Create a function named divisors/Divisors that takes an integer n greater than 1 and returns an array with all of the integer's divisors(except for 1 and the number itself), from smallest to largest. If the number is prime return the string '(integer) is prime' .
https://www.codewars.com/kata/544aed4...
Twitter - @quetcodesfire
Instagram - @quetcodesfire_