|November 19, 2006, 17:11||
PLEASE HELP ME WITH A SEQUENCE PROBLEM
There are 2 boys standing on a road, one kilometer apart from eachother. The boys names are Pete and John. Pete starts to run after John, moving at 1 meter per second. After 1 second the road stretches uniformly and instantaneously by 1 kilometer so now John is 1998 meters away from Pete. Pete tries to speed up but is still moving at 1 meter per second. After another second the road stretches again by 1 kilometer so now Pete is 2995.5 meters away. This keeps happening over and over again.
Does Pete ever catch up to John?
If he does, how long does it take?
set up a sequence where Dn represents the distance between Pete and John after n seconds, but before the road does its instantaneous stretch(immediately after the step but before the stretch)
find a general expression for Dn in terms of D0
|Thread||Thread Starter||Forum||Replies||Last Post|
|UDF compiling problem||Wouter||Fluent UDF and Scheme Programming||6||June 6, 2012 04:43|
|Gambit - meshing over airfoil wrapping (?) problem||JFDC||FLUENT||1||July 11, 2011 05:59|
|natural convection problem for a CHT problem||Se-Hee||CFX||2||June 10, 2007 06:29|
|Adiabatic and Rotating wall (Convection problem)||ParodDav||CFX||5||April 29, 2007 19:13|
|Is this problem well posed?||Thomas P. Abraham||Main CFD Forum||5||September 8, 1999 14:52|