20}
21
22
23function main() {24
25	$p = generatePrimes(1000000);
26	return $p[10000];

 1<?php
 2function generatePrimes($MAX_SIZE){ 3	$primes = [];
 4	$IsPrime = array_fill(0, $MAX_SIZE, TRUE);
 5	for ($p = 2; $p * $p < $MAX_SIZE; $p++) {

 1<?php
 2function main() { 3	$total = 0;
 4	$total2 = 0;
 5	for ($i = 1; $i <= 100; $i++) {

 8	return $a;
 9}
10
11function main() {12	$count = 1;
13	for ($i = 1; $i <= 20; $i++) {
14		$count *= floor($i / gcd($i, $count));

 1<?php
 2function gcd($a, $b) { 3	while ($b != 0) {
 4		$c = $a % $b;
 5		$a = $b;

 5	return $s == $c;
 6}
 7
 8function compute() { 9	$palendromes = array();
10	for ($i = 100; $i < 1000; $i++) {
11		for ($j = 100; $j < 1000; $j++) {

 1<?php
 2function isPalendromic($n) { 3	$s = strval($n);
 4	$c = strrev($s);
 5	return $s == $c;

 8	return $x;  
 9};
10
11function main() {12	$x = 600851475143;
13	while (true) {
14		$y = smallestFactor($x);

 1<?php
 2function smallestFactor($x) { 3	for ($i = 2; $i <= floor(pow($x, 0.5)); $i++) {
 4		if ($x % $i == 0) {
 5			return $i;

 1<?php
 2function compute() { 3	$a = 1;
 4	$b = 2;
 5	$total = 0;

 1<?php
 2function compute() { 3	$total = 0;
 4	for ($i = 0; $i < 1000; $i++) {
 5		if ($i % 3 == 0 || $i % 5 == 0) {