}
$prim2[] = 2;
$prim2[] = 3;
$darab = 0;
$i = 6;
while ($i - 1 < 1000000) {
if (Prim($prim2, $i - 1)) {
$prim2[] = $i - 1;
}
if (Prim($prim2, $i + 1)) {
$prim2[] = $i + 1;
}
$i += 6;
}
foreach ($prim2 as $elem) {
if (sameNum((string) $elem)) {
$prim[] = (string) $elem;
$darab++;
}
}
$darab--;
$log = ceil(log($darab, 2));
//echo LinearSearch($prim,"9419",$darab-1,ceil(log($darab-1,2)));
//echo ceil(log(17,2));
for ($k = 1; $k < count($prim); $k++) {
$elem = $prim[$k];
$n = strlen($elem);
unset($t);
for ($i = 0; $i < $n - 1; $i++) {
for ($j = $i + 1; $j < $n; $j++) {
if ($elem[$i] == $elem[$j] && $elem[$i] < "3") {
}
$i += 6;
}
$hasonlitas = 2;
foreach ($prim2 as $pri) {
if (sameNum2((string) $pri, $hasonlitas)) {
$prim[] = $pri;
}
}
$n = count($prim);
for ($i = 0; $i < $n; $i++) {
$hossz = strlen((string) $prim[$i]);
$j = $i + 1;
$tomb[] = $prim[$i];
while ($j < $n && strlen((string) $prim[$j]) == $hossz) {
if (Compare((string) $prim[$i], (string) $prim[$j], $hasonlitas)) {
$tomb[] = $prim[$j];
}
$j++;
}
if (sameNum((string) $prim[$i], $hasonlitas, $hol) && count($tomb) >= 8) {
echo $prim[$i] . " tartozok: ";
foreach ($tomb as $elem) {
if (sameNumWhere((string) $elem, $hol)) {
echo $elem . " ";
}
}
echo "<br>";
}
unset($tomb);
}
