I used the Carlos Alberto Martins method. I did not know that a different method would get the same answer.
Printable View
I used the Carlos Alberto Martins method. I did not know that a different method would get the same answer.
Once I actually got a pencil and paper out, used a relation tree method the solution came really quick (about a minute or so, took two simultaneous trees).
The only difficult thing with it is that you need to look at two different relation sets (trees) that are at different levels in the trees. However, it didn't have anything of the n! sort or c^n sort (c is an integer constant, n is an integer that is incremented from some starting number to some ending number) which are the two that I'm used to seeing.
I fumbled around in my head with a n! sequence before I got the pencil and paper out. It fits the first three, then the sequence out accelerates n! and n^n.
I just looked for a pattern, pulled out the trusty calculator and did the last calculation to get the last number, then rechecked my math. lol took 30 sec or so. I love patterns like this though, and am usually really good at picking them up.
My wife just got it too, in about a minute - and she's a redneck barmaid :p
n^2 + n is what I was thinking.
3263442, easy enough, took me about 3 mins, but I'm no engineer lol
n=(n-1)^2+(n-1)
Got it in about a minute.
Received my September 2009 Issue of CPU Magazine today.
Features your Dark Carbon Project. Resistance is Futile on Page.42
Wondering if I can FedEx it to you for an Autograph.
God I hate sequences. I just can't ever pick up on patterns in these things. : ( Always made me feel like an idiot in math class.