| 0 1 2 3 4 5 6 7 8 9
---------------------------
- | 1 1 1 1 1 1 1 1 1 1
- | 1 2 3 4 5 6 7 8 9
- | 1 3 6 10 15 ............
- | 1 4 10 20 ................
- | 1 5 15 35.................
The recursive function for this is F(x,y) = F(x-1,y) + F(x, y-1) unless x or y are zero in which case it returns 1. We were interested in the growth of y = 26, because we have 26
Now you may have noticed that this is very similar to pascals triangle (not the fibonacci series as I said earlier, I always get them confused).
So I monkied around with the pascal triangle formula and got this.
F(x,y) = (x + y)!/ (x!*y!)
While x! grows faster than 2^{x} this function doesn't grow so fast.
So what I am wondering is if there is any further work on this sort of problems.
Other things I have been doing, fiddling about with a branch I found in order to turn it into a bo staff so I can practise and get up at god awful hours and pretend I am hardcore. I refuse to spend lots of money on something I will likely get bored of at some point.
Also this week went to IT training place in Tolworth that said they will train me for $LOTS of money. If I get to a high enough level of training they will guarantee me a job or my money back. I don't know the full details but it sounds dodgy to me so I an stringing them along until I find the details.
* I lied about the linksto nude women, so sue me.
< The funniest lines of code evar? | BBC White season: 'Rivers of Blood' > |