How to resolve the algorithm Totient function step by step in the Raku programming language

Published on 12 May 2024 09:40 PM
#Raku

How to resolve the algorithm Totient function step by step in the Raku programming language

Table of Contents

Problem Statement

The   totient   function is also known as:

The totient function:

If the totient number   (for N)   is one less than   N,   then   N   is prime.

Create a   totient   function and: Show all output here.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Totient function step by step in the Raku programming language

Source code in the raku programming language

use Prime::Factor;

my \𝜑 = 0, |(1..*).hyper.map: -> \t { t * [*] t.&prime-factors.squish.map: { 1 - 1/$_ } }

printf "𝜑(%2d) = %3d %s\n", $_, 𝜑[$_], $_ - 𝜑[$_] - 1 ?? '' !! 'Prime' for 1 .. 25;

(1e2, 1e3, 1e4, 1e5).map: -> $limit {
    say "\nCount of primes <= $limit: " ~ +(^$limit).grep: {$_ == 𝜑[$_] + 1}
}

You may also check:How to resolve the algorithm Sorting algorithms/Sleep sort step by step in the Mathematica/Wolfram Language programming language
You may also check:How to resolve the algorithm 4-rings or 4-squares puzzle step by step in the Java programming language
You may also check:How to resolve the algorithm Honeycombs step by step in the Go programming language
You may also check:How to resolve the algorithm Simple windowed application step by step in the PicoLisp programming language
You may also check:How to resolve the algorithm Null object step by step in the PARI/GP programming language