Hi, all:

Just returned from Xmas vacations, first thing I do is have a look at this Forum and see the regular mail, where I notice the latest issue of Datafile (V23N6) is waiting for me, and lo and behold, my latest article ("Long Live the HP42S!") is included.

Just in case you're interested, and as a kind of past-due Xmas 'present', I'll send copies of my former Datafile

articles (**in PDF format**) to anyone requesting them.

Briefly, the articles you may request are:

**HP-11C: Long Live the HP-11C!**5-page article, includes an 84-step program which will quickly and accurately find the limit sum of any user-defined infinite alternating series, no matter how slowly it does converge (if at all).

**HP-12C: Long Live the HP-12C!**6-page article, includes a 72-step program which will play a challenging game of Bridge-It! against the user.

**HP-12C: Tried & Tricky Trigonometrics**10-page article, includes a 99-step program which evaluates all six trigonometric functions (sin, cos, tan and their inverses) very quickly and with full accuracy over an extended range of arguments.

**HP-12C: Serendipitous Solver**8-page article, includes a 37-step program which makes use of the built-in machine code solver and a number of financial functions to find a real root of polynomials up to 14th-degree (up to 1480th-degree or more if there are

groups of repeated coefficients). The program can also evaluate the polynomial for given arguments. Both root

finding and evaluation are implemented using built-in financial functions. without user-code loops or branching.**Time Voyager**An HP-related short story (11 pages), specifically written to commemorate Sir Isaac Newton.

**HP-15C: Long Live the HP-15C!**6-page article, includes a 64-step program which will compute and store the value of Euler's constant e

(=2.71828+) up to 208 decimal digits, using matrix operations.**HP-15C: Nth-degree Polynomial Fitting**7-page article, includes a 42-step program which will compute explicitly the coefficients of a polynomial of degree

N (for 2 <= N <= 6), which exactly fits (passes through) a given set of data points (x,y).**HP-41C: Long Live the Advantage ROM!**8-page article, includes the 62-step HP-41C/Advantage ROM version of the HP-15C program featured in HP-15C: Nth-degree Polynomial Fitting, extended to handle degrees much higher than 6, limited only by available RAM.

**HP-71B: Modest Mater**12-page article featuring a program that recursively solves arbitrary Mate-in-N chess problems. Fully commented and annotated listing plus examples included.

You can see all of them in HTML format at my web site (except "Modest Mater"), if you wish, but should you want **PDF** copies of them (identical facsimile to the published article) for storage in a binder or CD-R compilation for example, just send me an e-mail specifying which articles do you want to this address:

and I'll send them attached to my answer to your e-mail (absolutely free, of course !). Keep in mind that each article is some 100-150Kb in size, so you should make sure that your e-mail account has capacity enough to receive them and further, your e-mail server does not remove PDF attachments. The Subject of your e-mail ** must** be "HP CALCS: DATAFILE ARTICLES". This offer is valid till next Monday (2005-01-17)

By the way, I've recently submitted a new batch of articles to Datafile, so you can see them published right now in the very next issues, or else when I eventually make them available at my web site as well, within six months or so.

Best regards from V.