Threaded Mode | Linear Mode

Thomas Klemm · 05-15-2022, 05:33 PM

(05-15-2022 02:08 PM)Gene Wrote: Sure wish there were an English translation of all of this.

I like the illustrations, but especially the quarrelling queens on page 49 gave me a chuckle.
The program on page 52 takes 120 steps.
This seems to be quite a bit more than the solution in Xerxes' Calculator Benchmark:

Code:

        CLR CMS

        8 STO 11

 LBL A  RCL 00 X<->T

        RCL 11 X=T E

        CLR X<->T

        OP 20

        RCL 11 STO IND 00

 LBL B  1 SUM 10

        RCL 00 STO 09

 LBL C  INV DSZ 09 A

        RCL IND 00 - RCL IND 09 =

        X=T D

        ABS + RCL 09 - RCL 00 =

        INV X=T C

 LBL D  DSZ IND 00 B

        DSZ 00 D

 LBL E  RCL 10

        R/S

However I didn't count them.

The timing there is given as:
58:20 TI-58C
43:40 TI-59

Quote: Pour exécuter ce programme, on
appuie simplement sur CLR et A et,
après 53 minutes, on voit apparaître
enfin 15863724.

That is, we're in the same ballpark.
Don't miss the beautiful flow-chart on page 51.

The program for the TI-57 on page 66 to create a magic square looked interesting at first:

Quote: L'utilisation du programme est
simple ; il suffit d'entrer l'ordre du
carré puis de presser RST et R/S

But then it says:

Quote: Il n'est sans doute pas inutile de
rappeler que l'algorithme utilisé ne
donne des résultats utiles que si
l'ordre du carré est impair ; le pro-
gramme ne vérifie pas les entrées, et
il donne donc des résultats sans
signification si l'on introduit un n
pair.

Thus it looks like a variant of the following method is used:

01
02 06
03 07 11
04 08 12 16
05 09 13 17 21
10 14 18 22
15 19 23
20 24
25

After a shifting the coloured numbers we get:

03 20 07 24 11
16 08 25 12 04
09 21 13 05 17
22 14 01 18 10
15 02 19 06 23

Thanks for posting this.

(05-15-2022 03:57 PM)Garth Wilson Wrote: Does it work for anyone else?

Yes, it works for me.