}
if ($szam % $prim == 0) {
return 0;
}
}
return 1;
}
$prim2[] = 2;
$prim2[] = 3;
$i = 6;
$n = "5";
while ($i < 1000000) {
if (Prim($prim2, $i - 1)) {
$prim2[] = $i - 1;
}
if (Prim($prim2, $i + 1)) {
$prim2[] = $i + 1;
}
$i += 6;
}
$n = 0;
for ($i = 1; $i < 20000; $i++) {
$n += $i;
$l = true;
$oszto = 1;
foreach ($prim2 as $prim) {
if ($prim > $n / 8) {
break;
}
$eredeti = $prim;
if ($n % $eredeti == 0) {
if ($szam % $prim == 0) {
return 0;
}
}
return 1;
}
$prim[] = 2;
$prim[] = 3;
$darab = 2;
$i = 6;
$mod = 0;
while ($darab < 10001) {
if (Prim($prim, $i - 1)) {
$prim[] = $i - 1;
$darab++;
$mod = -1;
}
if ($darab > 10000) {
break;
}
if (Prim($prim, $i + 1)) {
$prim[] = $i + 1;
$darab++;
$mod = 1;
}
if ($darab > 10000) {
break;
}
$i += 6;
}
echo $i + $mod;
