Primes whose first and last number is 3: Difference between revisions

{{trans|Nim}}

 

I n == 2

R 1B

print(‘#4’.format(n), end' I (L.index + 1) % 11 == 0 {"\n"} E ‘ ’)

 

 

{{out}}

=={{header|Action!}}==

{{libheader|Action! Sieve of Eratosthenes}}

 

BYTE Func IsSpecialPrime(INT i BYTE ARRAY primes)

OD

PrintF("%E%EThere are %I primes",count)

{{out}}

[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Primes_whose_first_and_last_number_is_3.png Screenshot from Atari 8-bit computer]

{{Trans|ALGOL W}} With added stretch goal. As with the Go and other samples, generates the candidate sequence.

{{libheader|ALGOL 68-primes}}

INT max prime = 1 000 000; # largest number to consider #

# sieve the primes to max prime #

FOR i FROM 0 BY 10 TO 99 990 DO IF prime[ 300 003 + i ] THEN p3count +:= 1 FI OD;

print( ( newline, "Found ", whole( p3count, 0 ), " ""3x3"" primes below 1000000", newline ) )

{{out}}

<pre>

=={{header|ALGOL W}}==

As with the Go and oher samples, finds the numbers by generating the candidate seuence.

integer MAX_PRIME;

MAX_PRIME := 4000;

for i := 0 step 10 until 990 do p( 3003 + i );

end

{{out}}

<pre>

</pre>

=={{header|AWK}}==

# syntax: GAWK -f PRIMES_WHOSE_FIRST_AND_LAST_NUMBER_IS_3.AWK

BEGIN {

return(1)

}

{{out}}

<pre>

=={{header|C}}==

{{trans|FreeBASIC}}

#include<stdlib.h>

#include<math.h>

printf( "\n\nThere were %d primes of the form 3x3 below one million.\n", np );

return 0;

{{out}}<pre>

3 313 353 373 383 3023 3083 3163 3203 3253

=={{header|F_Sharp|F#}}==

This task uses [http://www.rosettacode.org/wiki/Extensible_prime_generator#The_functions Extensible Prime Generator (F#)]

//3 Sandwich Primes. Nigel Galloway: July 25th., 2021

primes32()|>Seq.takeWhile((>)4000)|>Seq.filter(fun n->n%10=3 && (n=3||(n>29 && n<40)||(n>299 && n<400)||n>2999))|>Seq.iter(printf "%d "); printfn ""

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2021-06-02}}

math.functions math.primes sequences ;

 

 

3 1,000,000 surrounded llength

{{out}}

<pre>

 

=={{header|Fermat}}==

!(3,' ');

for d = 1 to 5 do

!!;

!!('There were ',np,' primes of the form 3...3 below 1,000,000');

{{out}}<pre>

3 313 353 373 383 3023 3083 3163 3203 3253

 

=={{header|FreeBASIC}}==

 

dim as integer np = 1, d, n, i

next d

print : print

{{out}}<pre>

3 313 353 373 383 3023 3083 3163 3203 3253

=={{header|Go}}==

{{libheader|Go-rcu}}

 

import (

pcc := rcu.Commatize(pc)

fmt.Println("\nFound", pcc, "primes under 1,000,000 which begin and end with 3.")

 

{{out}}

 

See e.g. [[Erd%C5%91s-primes#jq]] for a suitable implementation of `is_prime`.

def count(s): reduce s as $x (null; .+1);

 

 

task(2),

{{out}}

<pre>

 

=={{header|Julia}}==

 

isxbyx(n, base=10, dig=3) = n ÷ prevpow(base, n) == dig && n % base == dig

println("\nTotal $(d)x$d primes less than 1,000,000: ", length(p3x3(1_000_000, 10, d)), ".")

end

<pre>

</pre>

=={{header|Mathematica}} / {{header|Wolfram Language}}==

 

{{out}}<pre>

 

=={{header|Nim}}==

 

func isPrime(n: Positive): bool =

stdout.write &"{n:4}", if (i + 1) mod 11 == 0: '\n' else: ' '

 

 

{{out}}

=={{header|Perl}}==

{{libheader|ntheory}}

 

use strict; # https://rosettacode.org/wiki/Primes_whose_first_and_last_number_is_3

my $n33 = grep /^3/ && /3$/, @{ primes( 1_000_000 ) };

print @n33 . " under 4000\n\n@n33" =~ s/.{75}\K /\n/gr,

{{out}}

<pre>

=={{header|Phix}}==

Works for any digit, partly inspired by the Wren entry.

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">primes_with_first_and_last_digit</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">d</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">p10</span><span style="color: #0000FF;">)</span>

<span style="color: #000000;">res</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">primes_with_first_and_last_digit</span><span style="color: #0000FF;">(</span><span style="color: #000000;">3</span><span style="color: #0000FF;">,</span><span style="color: #000000;">6</span><span style="color: #0000FF;">)</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"There are %d primes under 1,000,000 which begin and end in 3\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">)})</span>

{{out}}

<pre>

 

=={{header|Raku}}==

 

for 1,3,5,7,9 -> $bracket {

cache $list;

$title ~ $list.batch($cols)».fmt($fmt).join: "\n"

{{out}}

<pre>Primes up to 10000 bracketed by 1 - 39 matching:

 

Also, &nbsp; if a negative &nbsp; '''cols''' &nbsp; is specified, &nbsp; only the &nbsp; ''count'' &nbsp; of primes found is shown.

parse arg hi cols dig . /*obtain optional argument from the CL.*/

if hi=='' | hi=="," then hi= 4000 /*Not specified? Then use the default.*/

end /*k*/ /* [↑] only process numbers ≤ √ J */

#= #+1; @.#= j; sq.#= j*j /*bump # of Ps; assign next P; P square*/

{{out|output|text=&nbsp; when using the default inputs:}}

<pre>

 

=={{header|Ring}}==

load "stdlib.ring"

see "working..." + nl

see nl + "Found " + row + " numbers" + nl

see "done..." + nl

{{out}}

<pre>

 

=={{header|Sidef}}==

Enumerator({|callback|

callback(s.digits2num(base))

var count = numbers_with_edges(n).grep{.is_prime}.len

say "\nThere are #{count} primes <= #{n.commify} which begin and end in 3"

{{out}}

<pre>

 

===Basic task===

import "/trait" for Stepped

import "/seq" for Lst

System.print("Primes under 4,000 which begin and end in 3:")

for (chunk in Lst.chunks(primes, 11)) Fmt.print("$,5d", chunk)

 

{{out}}

===More general===

This version deals with primes (in base 10) beginning and ending with any specified digit and with up to a given number of digits.

import "/trait" for Stepped

import "/seq" for Lst

var primes = getQualifyingPrimes.call(x, d)

Fmt.print("Found $,d primes under $,d which begin and end with $d.\n", primes.count, 10.pow(d), x)

 

{{out}}

 

=={{header|XPL0}}==

int N, I;

[if N <= 1 then return false;

Text(0, " such primes found below 1,000,000.

");

 

{{out}}