Prime conspiracy: Difference between revisions

<langsyntaxhighlight lang="algol68"># extend SET, CLEAR and ELEM to operate on rows of BITS #

OD</langsyntaxhighlight>

<langsyntaxhighlight lang="c">#include <assert.h>

}</langsyntaxhighlight>

<langsyntaxhighlight lang="csharp">using System;

}</langsyntaxhighlight>

<langsyntaxhighlight Cpplang="cpp">#include <vector>

}</langsyntaxhighlight>

<langsyntaxhighlight Dlang="d">import std.algorithm;

}</langsyntaxhighlight>

<langsyntaxhighlight lang="scheme">

<langsyntaxhighlight lang="elixir">defmodule Prime do

Prime.conspiracy(1000000)</langsyntaxhighlight>

<langsyntaxhighlight lang="fsharp">

<langsyntaxhighlight lang="factor">USING: assocs formatting grouping kernel math math.primes math.statistics

MAIN: main</langsyntaxhighlight>

Avoiding base ten chauvinism, here are results for bases two to thirteen. The source file relies on the [[Extensible_prime_generator]] project for its collection of primes. The bitbag file being in place, execution takes about two minutes for a hundred million primes, approaching the thirty-two bit limit. <langsyntaxhighlight Fortranlang="fortran"> PROGRAM INHERIT !Last digit persistence in successive prime numbers.

END !That was easy.</langsyntaxhighlight>

<langsyntaxhighlight lang="freebasic">' version 13-04-2017

<langsyntaxhighlight Golang="go">package main

}</langsyntaxhighlight>

<langsyntaxhighlight lang="haskell">import Data.List (group, sort)

where groups = tail . group . sort . (\n -> zip (0: n) n) . fmap (`mod` 10) . take 10000</langsyntaxhighlight>

<langsyntaxhighlight Jlang="j"> /:~ (~.,. ' ',. ":@(%/&1 999999)@(#/.~)) 2 (,'->',])&":/\ 10|p:i.1e6

9->9 42843 0.042843</langsyntaxhighlight>

<langsyntaxhighlight Jlang="j"> /:~ (~.,. ' ',. '%',.~ ":@(%/&1 9999.99)@(#/.~)) 2 (,'->',])&":/\ 10|p:i.1e6

9->9 42843 4.2843%</langsyntaxhighlight>

<langsyntaxhighlight Jlang="j"> dgpairs=: 2 (,'->',])&":/\ 10 | p:

9->9 4.62292e6 0.0462292</langsyntaxhighlight>

<langsyntaxhighlight lang="java">public class PrimeConspiracy {

}</langsyntaxhighlight>

<langsyntaxhighlight lang="julia">using Printf, Primes

end</langsyntaxhighlight>

<langsyntaxhighlight lang="scala">// version 1.1.2

}</langsyntaxhighlight>

<langsyntaxhighlight Lualang="lua">-- Return boolean indicating whether or not n is prime

end</langsyntaxhighlight>

<langsyntaxhighlight lang="parigp">

conspiracy(maxx) = {

print("primes considered= ", maxx);

x = matrix(9, 9);cnt=0;p=2;q=2%10;

while( cnt< =maxx, 0;

<langsyntaxhighlight lang="parigp">

2 to 3 count: 1 freq 0.000100 %

1 to 1 count: 42853 freq 4.29 285296 %

1 to 3 count: 77475 freq 7.75 747492 %

1 to 5 count: 0 freq 0 .000000 %

1 to 7 count: 79453 freq 7.95 945292 %

1 to 9 count: 50153 freq 5.02 015295 %

3 to 1 count: 58255 freq 5.83 825494 %

3 to 3 count: 39668 freq 3.97 966796 %

3 to 5 count: 1 freq 0.000100 %

3 to 7 count: 72828 freq 7.28 282793 %

3 to 9 count: 79358 freq 7.94 935792 %

5 to 1 count: 0 freq 0 .000000 %

5 to 3 count: 0 freq 0 .000000 %

5 to 5 count: 0 freq 0 .000000 %

5 to 7 count: 1 freq 0.000100 %

5 to 9 count: 0 freq 0 .000000 %

7 to 1 count: 64230 freq 6.42 422994 %

7 to 3 count: 68595 freq 6.86 859493 %

7 to 5 count: 0 freq 0 .000000 %

7 to 7 count: 39604 freq 3.96 960396 %

7 to 9 count: 77586 freq 7.76 758592 %

9 to 1 count: 84596 freq 8.46 459592 %

9 to 3 count: 64371 freq 6.44 437094 %

9 to 5 count: 0 freq 0 .000000 %

9 to 7 count: 58130 freq 5.81 812994 %

9 to 9 count: 42843 freq 4.28 284296 %

<langsyntaxhighlight lang="pascal">

<langsyntaxhighlight lang="perl">use ntheory qw/forprimes nth_prime/;

for sort keys %freq;</langsyntaxhighlight>

<langsyntaxhighlight lang="prolog">

<langsyntaxhighlight lang="python">def isPrime(n):

print "{0} -> {1} count {2:5} frequency: {3}%".format(trans[0], trans[1], transMap[trans], 100.0 * transMap[trans] / limit)</langsyntaxhighlight>

<langsyntaxhighlight lang="rsplus">

<langsyntaxhighlight lang="racket">#lang racket

x y (~a freq #:min-width 8 #:align 'right) (~r (* 100 freq (/ 1 limit)) #:precision '(= 2))))</langsyntaxhighlight>

<syntaxhighlight lang="raku" perl6line>use Math::Primesieve;

say "$_ \tfrequency: {($_.value/$upto*100).round(.01)} %" for %conspiracy.sort;</langsyntaxhighlight>

<langsyntaxhighlight lang="rexx">/*REXX pgm shows a table of whatwhich last digit follows the previous last digit for N primes*/

parse/* argfor N .primes /*N: the number of primes to be genned*/

H=N*Parse (2**max(4,Arg (w%2+1)n ) ). /*used asN: a roughthe limitnumber forof theprimes sieve.to be looked at */

@.If n==''|n==."," Then /* Not specified? /*assume all numbers are prime (so far)*/

# n=11000000 /* Use the default /*primes found so far {assume prime 2}.*/

w=length(n-1) do j=3 by 2; if @.j=='' then iterate /*Is composite?W: width Thenused skipfor thisformatting number.o*/

digit 1 ──►--> 1 has a count of: 42853, frequency of: 4.2853%.

digit 1 ──►--> 3 has a count of: 77475, frequency of: 7.7475%.

digit 1 ──►--> 7 has a count of: 79453, frequency of: 7.9453%.

digit 1 ──►--> 9 has a count of: 50153, frequency of: 5.0153%.

digit 2 ──►--> 3 has a count of: 1, frequency of: 0.0001%.

digit 3 ──►--> 1 has a count of: 58255, frequency of: 5.8255%.

digit 3 ──►--> 3 has a count of: 39668, frequency of: 3.9668%.

digit 3 ──►--> 5 has a count of: 1, frequency of: 0.0001%.

digit 3 ──►--> 7 has a count of: 72828, frequency of: 7.2828%.

digit 3 ──►--> 9 has a count of: 79358, frequency of: 7.9358%.

digit 5 ──►--> 7 has a count of: 1, frequency of: 0.0001%.

digit 7 ──►--> 1 has a count of: 64230, frequency of: 6.4230%.

digit 7 ──►--> 3 has a count of: 68595, frequency of: 6.8595%.

digit 7 ──►--> 7 has a count of: 39603, frequency of: 3.9603%.

digit 7 ──►--> 9 has a count of: 77586, frequency of: 7.7586%.

digit 9 ──►--> 1 has a count of: 84596, frequency of: 8.4596%.

digit 9 ──►--> 3 has a count of: 64371, frequency of: 6.4371%.

digit 9 ──►--> 7 has a count of: 58130, frequency of: 5.8130%.

digit 9 ──►--> 9 has a count of: 42843, frequency of: 4.2843%.

<langsyntaxhighlight lang="ruby">require "prime"

prime_conspiracy(1_000_000)</langsyntaxhighlight>

<syntaxhighlight lang ="rust">struct BitArray// {main.rs

fn upper_bound_for_nth_prime(n : usize) -> usize {

fn compute_transitions(limit : usize) {

let sieve = SievePrimeSieve::new(upper_bound_for_nth_prime(limit));

for ((from, to), c) in & transitions {

let freq = 100.0 * (*c as f32) / (limit as f32);

println!("{} -> {}: count = {:7}, frequency = {:.2} %", from, to, c, freq);

}</langsyntaxhighlight>

for ((from, to), c) in & transitions {

let freq = 100.0 * (*c as f32) / (limit as f32);

println!("{} -> {}: count = {:7}, frequency = {:.2} %", from, to, c, freq);

<langsyntaxhighlight Scalalang="scala">import scala.annotation.tailrec

}</langsyntaxhighlight>

<langsyntaxhighlight Scalalang="scala">object PrimeConspiracy1 extends App {

}</langsyntaxhighlight>

<langsyntaxhighlight lang="seed7">$ include "seed7_05.s7i";

end func;</langsyntaxhighlight>

<langsyntaxhighlight lang="ruby">var primes = (^Inf -> lazy.grep{.is_prime})

}</langsyntaxhighlight>

End Sub</langsyntaxhighlight>

<langsyntaxhighlight lang="zkl">const CNT =0d1_000_000;

}</langsyntaxhighlight>