Find adjacent primes which differ by a square integer: Difference between revisions

Line 252:
for(i=3,1000000,j=nextprime(i+1);if(isprime(i)&&j-i>36&&issquare(j-i),print(i," ",j," ",j-i)))
</lang>
 
=={{header|Perl}}==
<lang perl>#!/usr/bin/perl
 
use strict; # https://rosettacode.org/wiki/Find_adjacents_primes_which_difference_is_square_integer
use warnings;
use ntheory qw( primes is_square );
 
my $primeref = primes( 1e6 );
for my $i (1 .. $#$primeref )
{
(my $diff = $primeref->[$i] - $primeref->[$i - 1]) > 36 or next;
is_square($diff) and print "$primeref->[$i + 1] - $primeref->[$i - 1] = $diff\n";
}</lang>
{{out}}
<pre>
89759 - 89689 = 64
107449 - 107377 = 64
288649 - 288583 = 64
368029 - 367957 = 64
381169 - 381103 = 64
396871 - 396733 = 100
400837 - 400759 = 64
445433 - 445363 = 64
623209 - 623107 = 64
625777 - 625699 = 64
637073 - 637003 = 64
710779 - 710713 = 64
725293 - 725209 = 64
779489 - 779413 = 64
801949 - 801883 = 64
803819 - 803749 = 64
821747 - 821677 = 64
832591 - 832519 = 64
838351 - 838249 = 100
844847 - 844777 = 64
883877 - 883807 = 64
912173 - 912103 = 64
919519 - 919447 = 64
954829 - 954763 = 64
981889 - 981823 = 64
997879 - 997813 = 64
</pre>
 
=={{header|Phix}}==
Anonymous user