Post Reply 
Short & Sweet Math Challenge #21: Powers that be
11-02-2016, 10:08 PM
Post: #6
RE: Short & Sweet Math Challenge #21: Powers that be
.
Hi, Gerson !

I'm truly glad to get your always valuable contributions to one of my S&SMC's, as in the good old times. A few comments:

(11-02-2016 05:47 AM)Gerson W. Barbosa Wrote:  HP 50g, 181.5 bytes, 14 seconds. Only 6 constants, though.

Why only 6 ? Not being versed in RPL I don't fully understand your code but I also don't see any reference to the maximum degree for the polynomials, which should be 8.

Quote:'X^3.+0.*X^2.+-1.*X-1.'              1.32471795724 
'X^4.+-1.*X^3.+0.*X^2.-1.'           1.3802775691 
'X^5.+-1.*X^4.+-1.*X^3.+X^2.-1.'     1.44326879127 
'X^6.+-1.*X^5.+-1.*X^4.+X^2.-1.'     1.50159480354 
'X^7.+-1.*X^6.+-1.*X^5.+X^2.-1.'     1.54521564973 
'X^8.+-1.*X^7.+-1.*X^6.+X^2.-1.'     1.57367896839

Also, even within this limited range, your program is missing two constants, one between 1.50.. and 1.54.. and another between 1.54.. and 1.57.., perhaps due to the typo that J-F pointed out (which I duly corrected) about the coefficients being -1, 0, or +1 (the '0' was missing in my OP).

Thnaks for your continued interest and best regards.
V.
.

  
All My Articles & other Materials here:  Valentin Albillo's HP Collection
 
Visit this user's website Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
RE: Short & Sweet Math Challenge #21: Powers that be - Valentin Albillo - 11-02-2016 10:08 PM



User(s) browsing this thread: 1 Guest(s)