- Visitors can check out the Forum FAQ by clicking this link. You have to register before you can post: click the REGISTER link above to proceed. To start viewing messages, select the forum that you want to visit from the selection below. View our Forum Privacy Policy.
- Want to receive the latest contracting news and advice straight to your inbox? Sign up to the ContractorUK newsletter here. Every sign up will also be entered into a draw to WIN £100 Amazon vouchers!
Reply to: Chef's Quick Brain Teaser, revisited
Collapse
You are not logged in or you do not have permission to access this page. This could be due to one of several reasons:
- You are not logged in. If you are already registered, fill in the form below to log in, or follow the "Sign Up" link to register a new account.
- You may not have sufficient privileges to access this page. Are you trying to edit someone else's post, access administrative features or some other privileged system?
- If you are trying to post, the administrator may have disabled your account, or it may be awaiting activation.
Logging in...
Previously on "Chef's Quick Brain Teaser, revisited"
Collapse
-
Brolly old son, you're making a big meal out of this. I think most if not all of us grasped the idea, namely that you were asking for the predecessor number in Chef's sequence based on the recurrence x_(r+1) = x_r * (x_r + 1).
-
Is it really the case that none of you use the "first try and solve the number on the left to get the formula - the numbers are usually smaller so you can do it quicker and in your head - then use that to determine the number on the right" technique?
That would have had you immediately thinking "What number, when multiplied by [ itself plus one ] gives the result one?"
That should have had bells ringing and got you thinking of the Golden Ratio: the number that is its own reciprocal plus one, of course.
With the Golden Ratio implied in the last question, I had presumed this had actually triggered the second question.
Although there are always an infinite number of polynomials for any number sequence, the famous Fibonacci sequence was obviously the relevant factor here (Occam's Razor).
Since the sequence tends toward the Golden Ratio, it seemed obvious that had triggered conned_tractor's question.
... it is the number before the first number...Originally posted by BrollyBonce View PostThose questions are actually related and I thought EO or sasguru or NickFitz or someone would spot the relationship and comment on it. They didn't, so I gave a clue in the form of a question:
3. "In the context of the first question in this thread, what is the significance of the number 0.6180339887498949......"
... and it is the muliplicand that requires the Golden Ratio multiplier.Originally posted by BrollyBonce View PostThat should have prompted someone to say, "Hey, not only is that number rhubarb regarding question 1, it is also rhubarb regarding question 2!"
4. When you have answered question 3 (and not before), why is that number significant to question 2 and, therefore, how are questions 1 and 2 related?
It really was that simple.Originally posted by BrollyBonce View PostCome on you clever people. What is the answer to questions 3 and 4?
I concur. I'll take that gun, if I may.Originally posted by BrilloPad View Post
Leave a comment:
-
I agree a million percent.Originally posted by Bagpuss View Post<expat's>
which is the same as
<Bagbuss's earlier>
x(n+1) = xn * (xn + 1)
so xn**2 + xn - x(n+1) = 0
when x(n+1) = 1,
xn = [ -1 +/- sqrt(1 + 4) ] /2
positive root = [ -1 + sqrt(5) ] /2 = 0.618 etc
I wasn't going to bother going through with it: the maths is only school-level but the notation is painfully ponderous in plain text.
Leave a comment:
-
-
[1] x1 = (1 + x0)x0, so x0 = ( -1+-sqrt(1-4x1) ) / 2Originally posted by BrollyBonce View Post
If x1 = x0 * (x0 + 1)
then x0 * (x0 + 1) = x1
Where x1 = 1 calculate x0 and put it in the series.
[2] x1 = (1 + x0)/x0, so x0 = 1/(x1-1)
Leave a comment:
-
Ah , but now observeOriginally posted by expat View PostThey are algebraically identical. However Churchill's shows the rule that is probably in mind to generate the series.
x(n+1) = xn * (xn + 1)
n = x * (x+1)
n = (x*x) + x
therefore
x * (x+1) = (x*x) +x
therefore
x = sqrt((x*(x+1)-x)
I refer to this as 'The Golden Rivet' (Which, colloquially, is an eight incher)
Leave a comment:
-
Originally posted by Churchill View PostAll I can see in question 1 is
x = x * (x + 1);They are algebraically identical. However Churchill's shows the rule that is probably in mind to generate the series.Originally posted by EternalOptimist View PostI thought it was
x = (x * x) + x

x(n+1) = xn * (xn + 1)
Leave a comment:
-
Is there a "hanging oneself" smilie available?
I'll settle for this
Leave a comment:
-
If you take the obvious solution for the series then yes - and that would then define the series as one of the possible solutions. See OwlHoots link for other solutions that are valid with that sequence.Originally posted by BrollyBonce View PostAnother HUGE hint.
What number came BEFORE in the series 1, 2, 6, 42, 1806, ...
I.e., what comes before the '1'?
Leave a comment:
-
BODMAS mate BODMASOriginally posted by DaveB View PostTold you I was simple
and apparently unable to read ()'s corectly.....
Originally posted by oracleslave View PostWhere's CUK's self proclaimed maths whiz?
He reads maths books as a hobby so maybe he should be setting the questionsLast edited by Bagpuss; 18 May 2009, 12:19.
Leave a comment:
-
Where's CUK's self proclaimed maths whiz?Originally posted by Bagpuss View PostI thought he already told us that.
Welcome to CUK does GCSE Maths
Leave a comment:
- Home
- News & Features
- First Timers
- IR35 / S660 / BN66
- Employee Benefit Trusts
- Agency Workers Regulations
- MSC Legislation
- Limited Companies
- Dividends
- Umbrella Company
- VAT / Flat Rate VAT
- Job News & Guides
- Money News & Guides
- Guide to Contracts
- Successful Contracting
- Contracting Overseas
- Contractor Calculators
- MVL
- Contractor Expenses
Advertisers

Leave a comment: