How to resolve the algorithm Digital root step by step in the Quackery programming language

Published on 12 May 2024 09:40 PM
#Quackery

How to resolve the algorithm Digital root step by step in the Quackery programming language

Table of Contents

Problem Statement

The digital root,

X

{\displaystyle X}

, of a number,

n

{\displaystyle n}

, is calculated: The additive persistence is the number of summations required to obtain the single digit. The task is to calculate the additive persistence and the digital root of a number, e.g.: The digital root may be calculated in bases other than 10.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Digital root step by step in the Quackery programming language

Source code in the quackery programming language

[ abs 0 swap 
  [ base share /mod 
    rot + swap 
    dup 0 = until ] 
  drop ]                           is digitsum    ( n --> n   )
  
[ 0 swap 
  [ dup base share > while
    dip 1+ 
    digitsum again ] ]             is digitalroot ( n --> n n )

[ dup digitalroot
  rot echo 
  say " has additive persistance "
  swap echo 
  say " and digital root of "
  echo 
  say ";" cr ]                     is task        ( n -->     )
  
627615 task
39390 task
588225 task
393900588225 task

You may also check:How to resolve the algorithm Luhn test of credit card numbers step by step in the Nanoquery programming language
You may also check:How to resolve the algorithm Longest common subsequence step by step in the zkl programming language
You may also check:How to resolve the algorithm Vector products step by step in the CLU programming language
You may also check:How to resolve the algorithm Esthetic numbers step by step in the REXX programming language
You may also check:How to resolve the algorithm Factorial step by step in the Jsish programming language