Rate this:
See more:
Hi everyone!
I have a exercise about parallel computing. My exercise is about calculating Golden ratio with Alchemi, i have to find out nth digit of this number but i don't know how. Someone could help me!!!
(Sorry, my english is really bad (>.<)! )
Posted 15-Nov-12 1:47am
Edited 23-Nov-12 22:40pm
v2
n.podbielski at 15-Nov-12 7:10am

What algorithm? It is a number (1+0.5^0.5)/2
http://en.wikipedia.org/wiki/Golden_ratio
silverhand1990 at 16-Nov-12 7:14am

If you want to have a Golden ratio with 1000 floating point numbers ? That's why i need an algorimth to calculate it. To calculating it, we have Newton Method but this Method cannot use in parallel computing...
Matt T Heffron at 15-Nov-12 12:55pm

Actually it is (1 + sqrt(5))/2 (not sqrt(0.5))
n.podbielski at 16-Nov-12 8:49am

You are right. I don,t know how this happend. :)
YvesDaoust at 25-Feb-13 12:36pm

What is Alchemi ?
YvesDaoust at 25-Feb-13 12:42pm

Your problem statement is incomplete. You first need to decide what method to use for the computation.
If the goal is just to practice parallel programming, you can pick any algorithm, even inefficient.
If the goal is to really accelerate the computation, then you need 1) to compute a huge number of decimals (otherwise it is not worth the trouble) and 2) to have a truly good sequential algorithm.
YvesDaoust at 25-Feb-13 12:44pm

Do you need to find all N first digits, or just the Nth ?

Rate this:

## Solution 1

1. Calculate Golden ratio[^]
2.Golden ratio calculator[^]
Rate this: