How to resolve the algorithm Minimum multiple of m where digital sum equals m step by step in the XPL0 programming language

Published on 12 May 2024 09:40 PM

#Xpl0

How to resolve the algorithm Minimum multiple of m where digital sum equals m step by step in the XPL0 programming language

Table of Contents

Problem Statement
Step by Step Solution
Sourcecode

Problem Statement

Generate the sequence a(n) when each element is the minimum integer multiple m such that the digit sum of n times m is equal to n.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Minimum multiple of m where digital sum equals m step by step in the XPL0 programming language

Source code in the xpl0 programming language

func SumDigits(N);      \Return sum of digits in N
int  N, S;
[S:= 0;
while N do
    [N:= N/10;
    S:= S + rem(0);
    ];
return S;
];

int  C, N, M;
[C:= 0; N:= 1;
repeat  M:= 1;
        while SumDigits(N*M) # N do M:= M+1;
        IntOut(0, M);
        C:= C+1;
        if rem (C/10) then ChOut(0, 9\tab\) else CrLf(0);
        N:= N+1;
until   C >= 40+30;
]

You may also check:How to resolve the algorithm Water collected between towers step by step in the 11l programming language
You may also check:How to resolve the algorithm Arithmetic/Integer step by step in the MUMPS programming language
You may also check:How to resolve the algorithm Hello world/Newline omission step by step in the Scheme programming language
You may also check:How to resolve the algorithm Factorial step by step in the REBOL programming language
You may also check:How to resolve the algorithm Man or boy test step by step in the Ruby programming language