How to calculate Golden ratio ?

Question

3.00/5 (1 vote)

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 0:47am

silverhand1990

Updated 23-Nov-12 21:40pm

v2

Add a Solution

Comments

n.podbielski 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 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 15-Nov-12 12:55pm

Actually it is (1 + sqrt(5))/2 (not sqrt(0.5))

n.podbielski 16-Nov-12 8:49am

You are right. I don,t know how this happend. :)

YvesDaoust 25-Feb-13 12:36pm

What is Alchemi ?

YvesDaoust 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 25-Feb-13 12:44pm

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

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

killing the bug softly... · Answer 1 · 2012-11-15T03:06:00

Solution 1

Please have a look into the following links

1. Calculate Golden ratio[^]
2.Golden ratio calculator[^]

Posted 15-Nov-12 3:06am

killing the bug softly...

André Kraak · Answer 2 · 2012-11-23T21:45:00

Solution 2

This article Generation of n Digits of the Golden Ratio (Phi)[^] should help.

Posted 23-Nov-12 21:45pm

André Kraak