1 , 12 , 123 , 1234 , 12345
What models this?
I've been thinking for like 1/2 hour.
Blogs > kdog3683 |
kdog3683
United States916 Posts
1 , 12 , 123 , 1234 , 12345 What models this? I've been thinking for like 1/2 hour. | ||
Myrmidon
United States9452 Posts
f[n] = 10*f[n-1]+n 3rd number is 10*12+3 = 123, 4th number is 10*123+4, etc. Hopefully the awkward notation (I forget the actual) is clear. | ||
aeronexus
United States392 Posts
| ||
Equinox_kr
United States7395 Posts
| ||
sigma_x
Australia285 Posts
such that "n" is a positive integer and f(1)=1 | ||
Equinox_kr
United States7395 Posts
On April 11 2008 12:58 sigma_x wrote: f(n) = -10/81+10/81*10^n-1/9*n such that "n" is a positive integer and f(1)=1 can't believe you registered on TL just to say that rofl | ||
sigma_x
Australia285 Posts
i've been browsing tl.net for a few years now but finally decided to get an account a week or so ago... | ||
xhuwin
United States476 Posts
On April 11 2008 13:10 Equinox_kr wrote: Show nested quote + On April 11 2008 12:58 sigma_x wrote: f(n) = -10/81+10/81*10^n-1/9*n such that "n" is a positive integer and f(1)=1 can't believe you registered on TL just to say that rofl ROFL. Hahaha that made my day. How did you find the explicit definition though? | ||
mikeymoo
Canada7170 Posts
On April 11 2008 13:10 Equinox_kr wrote: Show nested quote + On April 11 2008 12:58 sigma_x wrote: f(n) = -10/81+10/81*10^n-1/9*n such that "n" is a positive integer and f(1)=1 can't believe you registered on TL just to say that rofl I find this phenomenon quite often in homework help blogs. We shall call this the FPHH Theorem (First post homework help) | ||
sigma_x
Australia285 Posts
Edit: http://en.wikipedia.org/wiki/Recurrence_relation#Solving_non-homogeneous_recurrence_relations | ||
oneofthem
Cayman Islands24199 Posts
| ||
oneofthem
Cayman Islands24199 Posts
| ||
artofmagic
United States1951 Posts
| ||
mikeymoo
Canada7170 Posts
On April 11 2008 13:35 sigma_x wrote: i thought i'd make myself useful... sheesh. It breaks down at n=10 of course. Refer to "Solving non-homogeneous recurrence relations" on wikipedia for help. It involves solving the linear recurrence solution first which is f(n)=10f(n-1) and then guessing a solution for the non-linear part. Edit: http://en.wikipedia.org/wiki/Recurrence_relation#Solving_non-homogeneous_recurrence_relations Oh don't take it wrong. I'm not dissing you, I'm commending you. (No sarcasm) | ||
thunk
United States6233 Posts
| ||
fight_or_flight
United States3988 Posts
On April 11 2008 13:10 Equinox_kr wrote: Show nested quote + On April 11 2008 12:58 sigma_x wrote: f(n) = -10/81+10/81*10^n-1/9*n such that "n" is a positive integer and f(1)=1 can't believe you registered on TL just to say that rofl proof that homework threads are awesome | ||
| ||
Next event in 7h 26m
[ Submit Event ] |
StarCraft 2 StarCraft: Brood War Dota 2 Counter-Strike Super Smash Bros Other Games Organizations Other Games StarCraft 2 StarCraft: Brood War StarCraft 2 StarCraft: Brood War
StarCraft 2 • davetesta80 StarCraft: Brood War• aXEnki • intothetv • Gussbus • Kozan • IndyKCrew • LaughNgamez Trovo • Laughngamez YouTube • Migwel • Poblha League of Legends |
GSL Code S
Maru vs TY
Creator vs SHIN
ESL Pro Tour
ESL Pro Tour
World Team League
ESL Pro Tour
ESL Pro Tour
Online Event
World Team League
ESL Pro Tour
Hatchery Cup
[ Show More ] BSL
ESL Pro Tour
Sparkling Tuna Cup
World Team League
ESL Pro Tour
BSL
ESL Pro Tour
|
|