Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- <?php
- $seed = "a james";
- //compile list of prime numbers (2 - 104729)
- $fh = fopen("primes.txt", 'r');
- for($j = 0; $j < 10000; $j++){
- $primes[$j] = trim(fgets($fh));
- }
- //Create pseudo random number for each character in the seed
- $len = strlen($seed);
- for($i = 1; $i < $len+1; $i++){
- //number = absoluteValueOf(decimalValueOfCharacter ^ (characterPosition (mod 6) + 1) (mod 104730) + 1); 104730 is 1 greater than the 10000th prime.
- //It's not very random, but it will do.
- $str[$i] = abs((pow(ord($seed[$i-1]), ($i%6)+1)%104730) + 1);
- $j = $i;
- }
- //display each pseudo random number for each character in the seed
- foreach($str as $echo){
- echo "$echo ";
- }
- echo "<br />";
- //find the closest prime number to each of the pseudo random numbers
- for($i = 1; $i <= $j; $i++){
- $dist = 104729;
- foreach($primes as $test){
- if(abs($test - $str[$i]) < $dist){
- $dist = abs($test - $str[$i]);
- $primeRelation[$i] = $test;
- }else{
- break 1;
- }
- }
- }
- //display each of the closest primes
- foreach($primeRelation as $echo){
- echo "$echo ";
- }
- ?>
Advertisement
Add Comment
Please, Sign In to add comment