HI,

The Golden Ratio describes the relation of two parts of something to the sum of it:

A + B = C

B / A = C / B

after some calculation one will find that

A / B = B / C = 5,SQRT,1,-,2,/ = 0.6180.... = g

One interesting property of the value of the Golden Ratio is the following:

g,1/x=g,1,+

...so I thought, squarooting is boring...tease the Solver instead:

LBL "f", MVAR "x", STO "x", 1/x, RCL "x", -, 1, -

But this results in some strange results depending on what was

choosen as lower and upper limit.

What I am doing wrong here ? Is the Solver Golden-Ratio-proof...or ?

Cheers!

Meino

PS: Deviding the nth and the (n+1)th value of the Fibonacci sequence will

give you g also....the accuracy depends on how high "n" was choosen.

## The Solver and the Golden Ratio / Golden Cut

### The Solver and the Golden Ratio / Golden Cut

DM 42 - SN: 00373, Firmware v.:3.11. / 3.11. as compiled by SwissMicros

### Re: The Solver and the Golden Ratio / Golden Cut

The STO "x" should be RCL "x".

### Re: The Solver and the Golden Ratio / Golden Cut

Hi ijabbott,

OH YES! Thanks a lot...until now, I thought the X-value (as the the "x" in f(x)) is

also in the x-register of the stack when the function is called, which should

be solved.

Seems not to be the case.

Thanks for the hint -- now it works as exspected (tm) !

Cheers

Meino

OH YES! Thanks a lot...until now, I thought the X-value (as the the "x" in f(x)) is

also in the x-register of the stack when the function is called, which should

be solved.

Seems not to be the case.

Thanks for the hint -- now it works as exspected (tm) !

Cheers

Meino

DM 42 - SN: 00373, Firmware v.:3.11. / 3.11. as compiled by SwissMicros