matheustp

const divisors = [...Array(10).keys()].slice(1)  //Poderia ser qlqr array, apenas mantive o que ja tava no codigo

const divisorNotEqual1 = (number) => number != 1
const divisorNotEqualNumber = (divisor, number) => divisor != number 
const isDivisible = (number) => (divisor) => divisorNotEqual1(divisor) && divisorNotEqualNumber(divisor, number) && number % divisor === 0 
const allDivisors = (numberIsDivisibleBy) => divisors.filter(numberIsDivisibleBy)

const isPrime = (number) => {
  const divisors = allDivisors(isDivisible(number))
  if (divisors.length == 0) {

matheustp

import { List, Map } from 'immutable';
import { expect } from 'chai';

import { setEntries, next, vote, restart } from '../src/core';

describe('application logic', () => {
  describe('setEntries', () => {
    it('adds the entries to the state', () => {
      const state = Map();
      const entries = List.of('Jon Snow', 'Ramsay Snow');