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

Published on 12 May 2024 09:40 PM
#Bqn

How to resolve the algorithm Totient function step by step in the BQN 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 BQN programming language

Source code in the bqn programming language

GCD ← {𝕨(|𝕊⍟(>⟜0)⊣)𝕩}
Totient ← +´1=⊢GCD¨1+↕


   Totient¨1+↕25
⟨ 1 1 2 2 4 2 6 4 6 4 10 4 12 6 8 8 16 6 18 8 12 10 22 8 20 ⟩

   "Number"‿"Totient"‿"Prime?"∾˘{𝕩∾(⊢≍(𝕩-1)⊸=)Totient¨𝕩}1+↕25
┌─                                                                             
╵ "Number"  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25  
  "Totient" 1 1 2 2 4 2 6 4 6 4  10 4  12 6  8  8  16 6  18 8  12 10 22 8  20  
  "Prime?"  0 1 1 0 1 0 1 0 0 0  1  0  1  0  0  0  1  0  1  0  0  0  1  0  0   
                                                                              ┘

You may also check:How to resolve the algorithm Walk a directory/Recursively step by step in the Caché ObjectScript programming language
You may also check:How to resolve the algorithm Vampire number step by step in the C++ programming language
You may also check:How to resolve the algorithm Loops/Break step by step in the EMal programming language
You may also check:How to resolve the algorithm Animate a pendulum step by step in the VBScript programming language
You may also check:How to resolve the algorithm Averages/Mode step by step in the Haskell programming language