HP 50G vs. HP Prime

[Vtile]

You did forget a fast swap energy source for 50g.. That were one of the reasons I only had 3 models to choose from when looking a new calculator.

Prime: Rechargeable Battery and 50g: Rechargeable Batteries (4 pieces)


Backlit screen would be a true pro for Prime.

All in all 50g draws longer straw.. I like Prime in many ways, but now after I have accustomed to 50g I can not ever change something as cumbersome to program as the Prime is, since lets face it UserRPL (or RPN for those who are used to it) is just too easy, fast (programming) and productive way of program "pocket sketch pad" and interact with the unlimited pad (stack). Unfortunately the system is getting oldish, with its connectivity and some key filesharing abilities which is shame. Hopefully the discontinuation were just rumour, since 50g is (or would be the best) a great machine, with some modernisation (like ARM based OS), connectivity updates, overlay holder build in, bigger flash chip (to just make it infinite) and some modest miniaturising for those who arent restricted to exam regulations. It still is more a calculator where Prime is flirting with the "learning assistant" field (which ofcourse is where the bigger business are).

I like your blog btw.. I found one Prime program and with my 50g variant in form a "doesn't prove anything" style example.

Code:

 HP Prime Program:  SIMPRULE
EXPORT SIMPRULE()
BEGIN
// EWS 2016-06-05
HAngle:=0; // Radians
LOCAL f;
INPUT({{f,[8]},A,B,N},
"Simpson Rule",
{"f(X)=","Low:","High:",
"Intervals (Even):"});
H:=(B-A)/N;
X:=A; T:=EVAL(f);
X:=B; T:=EVAL(f)+T;
FOR I FROM 1 TO N-1 DO
X:=A+I*H;
IF FP(I/2)==0 THEN
T:=2*EVAL(f)+T;
ELSE
T:=4*EVAL(f)+T;
END;
END;
T:=T*H/3;
RETURN T;
END;

One variation I cooked up a few months ago for 50g with UserRPL, based on my old math book (one variation of the many "simpson rules" equations floating around), so it is not optimised in any way.
:
This separate program calculates the x values, and put them stack in the order that is suitable for the next part. Your example program for Prime (NOTE: For a random reader, this below implementation gives totally wrong value for integral in small number of n for some functions. I haven't searched the reason (bug on code or in math formula). )
Call (in ALG for convenience) SRval(equation,low,high)

Code:

<< 0 /-> EQU a b n k
  << A B - N / 'K' STO a b
        FOR Y Y 'X' STO
        EQU EVAL k
        STEP k
 >> 'X' PURGE
"LAST = X2-X1" MSGBOX
>>

The actual simpson rule implementation.
Call: press of the softkey after SRval

Code:

<<DEPTH 1 - 1 /-> H N T
<< DUP MIROR 
2 N  START
   IF 'T==1'
   THEN SWAP 4 * + 0 'T' STO
   ELSE 2 * + 1 'T' STO
   END
  NEXT
"Simpson says.." MSGBOX
  SWAP - H 3 / * >>
>>

MIROR command is subprogram to mirror stack, basicly just: << DEPTH ->LIST REVLIST LIST-> DROP >> this could have been avoided naturally by calculating from "right" to "left".

The last one might actually be handy at some point for handwritten data, the first one is pretty useless outside testing purposes, since the internal integrator is good enough for my modest needs.

Like said proves nothing. My code is freedomain.

edit. some typos and brainjelly logic on text.