idivis inWP34s

[Dieter]

(11-27-2015 07:26 PM)ggauny@live.fr Wrote:  I am working to calcul all divisors of a number positiv and different of zero, in this last case all numbers are divisors of course. It is because I love fun arithmetics thing like perfects numbers and so on.

So you want all divisors, sorted in ascending order?
E.g. 1235 should return 1 5 13 19 65 95 247 and finally 1235?

(11-27-2015 07:26 PM)ggauny@live.fr Wrote:  I have do a flowchart (I hope attachement will run, I encounter somme issues this later days with this).

What about posting your program?

An implementation of your flowchart could look like this:

Code:

FILL
Clx
STO L     // store divisor i in L
x<> L
INC X     // i:=i+1
x≥y?      // i >= n?
RTN       // then quit (should display n as the last divisor)
RMDR      // calculate n mod i (while i stays in L)
x≠0?      // n not divisble by i ?
BACK 006  // test next divisor
x<> L
STOP      // else display i
BACK 008

And here is a version that tests up to n/2:

Code:

FILL
Clx
STO L     // store divisor i in L
x<> L
INC X     // i:=i+1
RCL+X     // compare n and 2*i while keeping i in L
x≤y?      // 2i ≤ n  resp.  i ≤ n/2 ?
SKIP 002  // then continue
DROP
RTN       // else display n and quit 
x<> L     // recall i again
RMDR      // calculate n mod i (while i stays in L)
x≠0?      // n not divisble by i ?
BACK 010  // test next divisor
x<> L
STOP      // else display i
BACK 012

Now, how did you do it?

Dieter