HP Forums

Full Version: HP 39gii Tutorial: REPEAT and WHILE
You're currently viewing a stripped down version of our content. View the full version with proper formatting.

Hi Eddie

here is an improved version of your SQFACTOR program :

EXPORT SQFACTOR(N)
BEGIN
LOCAL C,K,S;
C:=1;
K:=FLOOR(VN); // V for square root symbol
WHILE K > 1 DO
WHILE FRAC(N/K²) == 0 DO
N:=N/K²;
C:=C*K;
END;
K:=K-1;
END;
S:="";
IF C<>1 THEN S:=string(C);END;
IF N<>1 THEN S:=S+"V"+string(N); END;
RETURN S;
END;

So SQFACTOR(400) returns "20" and not "4 &#8730; 25"


Edited: 19 Mar 2013, 7:26 a.m.

Thanks Giles! I am going to test this out

Here is an interesting program by C.RET posted on silicium.org


EXPORT RAC(X)
BEGIN
LOCAL F:=SIGN(X), R:=ABS(X);
LOCAL I:=1,Txt:="V("+X+")=";

REPEAT
IF R MOD I*I
THEN I:=I-1;
ELSE F:=F*I; R:=R/I/I; I:=FLOOR(VR);
END;
UNTIL I<2;

IF (ABS(F)<>1) OR (R=F) THEN Txt:=Txt+ABS(F) END;
IF F<0 THEN Txt:=Txt+" i " END;
IF R<>1 THEN Txt:=Txt+"V"+R END;
RETURN Txt;
END;

Change V by square root symbol
it works also with negative numbers :

I did not know we could initialize and localize variables in one step. This will make things more efficient.

Gilles, is it OK if I post your program in my next blog entry? Credit will be given.

Eddie

Hi Eddie, this program is not by me, but by C.RET.

Eddie you are welcome.

No problem at all, I consider this code has already fallen into the public domain since I posted it this public forum. It was the result of a kid of brain storm threat. Several people were involved in the discussion. Gilles is one of them.

Please feel free to publish it, as soon as you are kind enough to indicate references of the peoples and the Silicium.org forum.

www.silicium.org/forum
[hp39gII] Simplificateur de racines carrées
([hp39gii] A Square Roots Simplicator)

The HP-39gii is really an amazing system. Every day, we discover new capabilities; the localization and initialization in one shot is one of its numerous features.

The Silicium.org forum is really active, we already analyze this first version of the code and turn it into two new versions :

EXPORT RAC(X)
BEGIN
LOCAL F:=SIGN(X), R:=ABS(X);
LOCAL I:=1,Txt:="¡Ì("+X+")=";

REPEAT
IF R MOD I*I
THEN I:=prevprime(I);
ELSE F:=F*I; R:=R/I/I; I:=FLOOR(¡ÌR);
END;
UNTIL Q<2;

IF (ABS(F)<>1) OR (R=F) THEN Txt:=Txt+ABS(F) END;
IF F<0 THEN Txt:=Txt+" i " END;
IF R<>1 THEN Txt:=Txt+" \V"+R END;
RETURN Txt;
END;

The only change is prevprime(I) replacing I:=I-1; expecting speed-up with large numbers.

The last version, is quite more different, it is using the built-in function ifactors that returns the list of prime factors (and multiplicity). This last version has the shortest/fastest look-up loop !

EXPORT RAC( X )
BEGIN
LOCAL F:=SIGN(X),R:=ABS(X);
LOCAL p,I,T:="¡Ì("+X+")=";

LOCAL LF:=ifactors(R);

FOR p FROM 2 TO SIZE(LF) STEP 2 DO
I:=LF(p-1)^FLOOR(LF(p)/2);
F:=F*I; R:=R/I/I;
END;

IF (ABS(F)<>1) OR (R=F) THEN T:=T+ABS(F) END;
IF F<0 THEN T:=T+" i " END;
IF R<>1 THEN T:=T+" \V"+R END;
RETURN T;
END;


Edited: 20 Mar 2013, 6:40 p.m.