Euler #5, #6 y #7

https://projecteuler.net/problem=5

   1 #!/usr/bin/env python3
   2 
   3 divisors = range(1, 20);
   4 test = divisors[-1]
   5 control = True
   6 while control:
   7     divisible = True
   8     for d in divisors:
   9         if test % d != 0:
  10             divisible = False
  11             break
  12 
  13     if divisible:
  14         control = False
  15     else:
  16         test += 1
  17 
  18 print (test)
  19 

---

https://projecteuler.net/problem=6

JavaScript:

   1 
   2 var sum = 0;
   3 var squares = 0;
   4 for (var i = 0; i <= 100; i++) {
   5   sum += i;
   6   squares += i*i;
   7 }
   8 console.log(sum * sum - squares);
   9 

---

https://projecteuler.net/problem=7

PHP:

   1 <?php
   2 // https://projecteuler.net/problem=7
   3 
   4 function isPrime($num) {
   5   if ($num == 2) return true;
   6   if ($num < 2 || $num % 2 == 0) return false;
   7   $max = (int) sqrt($num);
   8   for ($i = 3; $i <= $max; $i +=2) {
   9       if ($num % $i == 0) {
  10           return false;
  11       }
  12   }
  13   return true;
  14 }
  15 
  16 $counter = 0;
  17 $num = 2;
  18 $stop = false;
  19 while (true) {
  20   if (isPrime($num)) {
  21     $counter++;
  22     if ($counter == 10001) {
  23       echo "$num\n";
  24       break;
  25     }
  26   }
  27   $num++;
  28 }
  29