title: Find the lowest common divisor in divisors array
body: <p>i have a math question in javascript:</p>
  
  <p>I have array of divisors :</p>
  
  <p>var divisors  = ["3","4","5","10","12","15","20","30","60"]</p>
  
  <p>and number of items that should be divide without a reminder in one of those items:</p>
  
  <p>var items_to_divide = ["10","30"]</p>
  
  <p>i'm looking for a function that will give me the lowest common divisors from list of divisors (var divisors) between in items_to_divide.</p>
  
  <p>In this example the result should be 5, cause 10 / 5 = 2 and 30 / 5 = 6 so 5 is the lowest common divider, cause they both divide with 5 without a reminder.</p>
  
  <p>anyone can suggest a nice logic here?</p>