Numbers whose count of divisors is prime: Difference between revisions

{{trans|FreeBASIC}}

I a == 2

R 1B

print()

{{out}}

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

{{libheader|Action! Sieve of Eratosthenes}}

INT FUNC CountDivisors(INT x)

FI

OD

{{out}}

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

=={{header|ALGOL 68}}==

Counts the divisors without using division.

INT max number := 1 000;

TO 2 DO

max number := 100 000

OD

{{out}}

<pre>

=={{header|AWK}}==

# syntax: GAWK -f NUMBERS_WHOSE_COUNT_OF_DIVISORS_IS_PRIME.AWK

BEGIN {

return(1)

}

{{out}}

<pre>

==={{header|BASIC256}}===

{{trans|FreeBASIC}}

if v < 2 then return False

if (v mod 2) = 0 then return v = 2

print

print "Found "; row; " numbers"

==={{header|FreeBASIC}}===

If ValorEval < 2 Then Return False

If ValorEval Mod 2 = 0 Then Return ValorEval = 2

Print !"\n\nFound"; row; " numbers"

{{out}}

<pre>Numbers which count of divisors is prime are:

{{works with|QuickBasic}}

{{trans|FreeBASIC}}

PRINT "Numbers which count of divisors is prime are:"

WEND

isPrime = True

==={{header|PureBasic}}===

{{trans|FreeBASIC}}

If v <= 1 : ProcedureReturn #False

ElseIf v < 4 : ProcedureReturn #True

Input()

CloseConsole()

==={{header|Yabasic}}===

{{trans|FreeBASIC}}

print "Numbers which count of divisors is prime are:"

end while

return True

{{out}}

<pre>

=={{header|C++}}==

#include <cstdlib>

#include <iomanip>

std::cout << "\nCount: " << count << '\n';

return EXIT_SUCCESS;

{{out}}

=={{header|CLU}}==

div_counts = proc (n: int) returns (sequence[int])

divs: array[int] := array[int]$fill(1,n,1)

end

stream$putl(po, "\nFound " || int$unparse(count) || " numbers.")

{{out}}

<pre> 4 9 16 25 49 64 81 121 169 289

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

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

// Numbers whose divisor count is prime. Nigel Galloway: July 13th., 2021

primes64()|>Seq.takeWhile(fun n->n*n<100000L)|>Seq.collect(fun n->primes32()|>Seq.skip 1|>Seq.map(fun g->pown n (g-1))|>Seq.takeWhile((>)100000L))|>Seq.sort|>Seq.iter(printf "%d "); printfn ""

{{out}}

<pre>

=={{header|Factor}}==

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

math.primes.factors math.ranges sequences sequences.extras ;

FROM: math.extras => integer-sqrt ;

[ sq ] [ divisors length odd-prime? ] map-filter ;

{{out}}

<pre>

=={{header|Go}}==

{{libheader|Go-rcu}}

import (

}

fmt.Printf("\n\nFound %d such integers (%d under 1,000).\n", len(results), under1000)

{{out}}

For a suitable definition of `is_prime`, see [[Erd%C5%91s-primes#jq]].

def count_divisors:

1000, 100000

| "\nn with odd prime divisor counts, 1 < n < \(.):",

{{out}}

<pre>

=={{header|Julia}}==

ispdc(n) = (ndivs = prod(collect(values(factor(n))).+ 1); ndivs > 2 && isprime(ndivs))

foreach(p -> print(rpad(p[2], 8), p[1] % 10 == 0 ? "\n" : ""), enumerate(filter(ispdc, 1:100000)))

<pre>

4 9 16 25 49 64 81 121 169 289

</pre>

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

maxPrime = NextPrime[Sqrt@max, -1];

maxPower = NextPrime[Log[2, max], -1];

TableForm, "Numbers up to 1000 with prime divisor counts:", Top]

Labeled[Partition[ans, UpTo[8]] //

{{out}}<pre>

Checking only divisors of squares (see discussion).

for i, n in list:

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

{{out}}

=={{header|Pascal}}==

{$IFDEF FPC}

// {$R+,O+} //debuging purpose

writeln;

SpeedTest(pD,4000*1000*1000);

{{out}}

<pre> 1 2 3 4 5 6 7 8 9 10

=={{header|Perl}}==

{{libheader|ntheory}}

use warnings;

use ntheory <is_prime divisors>;

push @matches, $_**2 for grep { is_prime divisors $_**2 } 1..int sqrt 1e5;

{{out}}

<pre>79 matching:

=={{header|Phix}}==

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

<span style="color: #008080;">function</span> <span style="color: #000000;">pd</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">)</span> <span style="color: #000000;">n</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">factors</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">,</span><span style="color: #000000;">1</span><span style="color: #0000FF;">))</span> <span style="color: #008080;">return</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">!=</span><span style="color: #000000;">2</span> <span style="color: #008080;">and</span> <span style="color: #7060A8;">is_prime</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">end</span> <span style="color: #008080;">function</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;">"%d &lt; %,d found: %V\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><span style="color: #000000;">n</span><span style="color: #0000FF;">,</span><span style="color: #7060A8;">shorten</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">,</span><span style="color: #008000;">""</span><span style="color: #0000FF;">,</span><span style="color: #000000;">5</span><span style="color: #0000FF;">)})</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

<pre>

=={{header|Raku}}==

my $ceiling = ceiling sqrt 1e5;

cache $list;

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

{{out}}

<pre>79 matching:

=={{header|REXX}}==

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

if hi=='' | hi=="," then hi= 1000 /*Not specified? Then use the defaults*/

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

#= #+1; @.#= j; s.#= j*j; !.j= 1 /*bump # of Ps; assign next P; P²; P# */

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

<pre>

=={{header|Ring}}==

load "stdlib.ring"

row = 0

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

see "done..." + nl

{{out}}

<pre>

=={{header|Sidef}}==

say "Positive integers under #{limit.commify} whose number of divisors is an odd prime:"

1..limit -> grep { !.is_prime && .sigma0.is_prime }.each_slice(10, {|*a|

say a.map{'%6s' % _}.join(' ')

{{out}}

<pre>

{{libheader|Wren-seq}}

{{libheader|Wren-fmt}}

import "/seq" for Lst

import "/fmt" for Fmt

for (chunk in Lst.chunks(results, 10)) Fmt.print("$,7d", chunk)

var under1000 = results.count { |r| r < 1000 }

{{out}}

=={{header|XPL0}}==

int N, I;

[if N <= 1 then return false;

if rem(Count/10) = 0 then CrLf(0) else ChOut(0, 9\tab\);

];

{{out}}