katas for homework

gistfile1.txt

https://www.codewars.com/users/krock/completed_solutions

function divisors(integer) {
 z = []
 i = 2
 while ((i <= integer - 1)){
   if (integer % i === 0){
    z.push( i) 
   }
   i++
   }
   return z.length === 0 ?  `${integer} is prime` : z
}



function invert(a) {

 roots = a.map(function (n) {
    if (n !== 0) { return -n } 
    if (n === 0) { return 0 }
  })
 
  if (a.length === 0){ 
  return a
  } else {
  return roots
  } 
}