How to resolve the algorithm Harshad or Niven series step by step in the uBasic/4tH programming language

Published on 12 May 2024 09:40 PM
#Ubasic/4th

How to resolve the algorithm Harshad or Niven series step by step in the uBasic/4tH programming language

Table of Contents

Problem Statement

The Harshad or Niven numbers are positive integers ≥ 1 that are divisible by the sum of their digits. For example,   42   is a Harshad number as   42   is divisible by   (4 + 2)   without remainder. Assume that the series is defined as the numbers in increasing order.

The task is to create a function/method/procedure to generate successive members of the Harshad sequence. Use it to:

Show your output here.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Harshad or Niven series step by step in the uBasic/4tH programming language

Source code in the ubasic/4th programming language

C=0

For I = 1 Step 1 Until C = 20          ' First 20 Harshad numbers
  If FUNC(_FNHarshad(I)) Then Print I;" "; : C = C + 1
Next

For I = 1001 Step 1                    ' First Harshad greater than 1000
  If FUNC(_FNHarshad(I)) Then Print I;" " : Break
Next

End

_FNHarshad Param(1)
  Local(2)

  c@ = a@
  b@ = 0
  Do While (c@ > 0)
     b@ = b@ + (c@ % 10)
     c@ = c@ / 10
  Loop

Return ((a@ % b@) = 0)

You may also check:How to resolve the algorithm String length step by step in the SQL programming language
You may also check:How to resolve the algorithm Summarize primes step by step in the Fermat programming language
You may also check:How to resolve the algorithm Middle three digits step by step in the Groovy programming language
You may also check:How to resolve the algorithm Call an object method step by step in the Perl programming language
You may also check:How to resolve the algorithm Leonardo numbers step by step in the Lua programming language