I don't know how do you derive that and what is n stand for
所在版块:求学狮城 发贴时间:2008-06-19 15:35

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
Probably you have misunderstanding in my question.

Apparently, as long as worm speed > 0, the speed of worm relative to ground is increasing at every time instance and approaching the string stretching speed. Since the increasing of worm speed will never stop until reaching string stretching speed, it will definitely catch up after some time.
.
欢迎来到华新中文网,踊跃发帖是支持我们的最好方法!

 相关帖子 我要回复↙ ↗回到正文
这里好冷清,再出两个数学/物理题,活跃一下气氛 大树下   (455 bytes , 953reads )
我的解法-第二题 大树下   (1061 bytes , 415reads )
我的解法-第一题 大树下   (1157 bytes , 369reads )
so any hint to Q1? 1300cc   (0 bytes , 231reads )
fianlly got it. only A contribute to the progress between A,B. 1300cc   (12 bytes , 240reads )
第一题,正方形的话爬了1米,正三角形的话是2/3 shwan   (77 bytes , 404reads )
cant figure out q1. 1300cc   (6 bytes , 263reads )
第一题你是对的 大树下   (87 bytes , 393reads )
小虫匀加速?加速度是0.01?那就是51? shwan   (0 bytes , 311reads )
2nd problem 1300cc   (71 bytes , 426reads )
... 大树下   (60 bytes , 320reads )
i mean 1D. a quarter circle maybe is preferred. 1300cc   (15 bytes , 266reads )
老兄你在乱猜是吧 大树下   (16 bytes , 299reads )
the trajectory of each worm should be a whirling line. (my guess) 1300cc   (224 bytes , 272reads )
1。永远不能相遇,或者题目给的不对 1300cc   (438 bytes , 469reads )
第二题:条件足够了 大树下   (980 bytes , 481reads )
think in a 2nd way 1300cc   (343 bytes , 507reads )
I don't know how do you derive that and what is n stand for 大树下   (346 bytes , 376reads )
while. we need formula to prove that. think e.g the worm speed is a function 1300cc   (135 bytes , 277reads )
speed converge to v1+v2 大树下   (880 bytes , 402reads )
i solve the integration wrongly 1300cc   (125 bytes , 227reads )
actually 1300cc   (483 bytes , 261reads )
approaching v1 + v2. 大树下   (0 bytes , 327reads )
so it will never catch up. 1300cc   (153 bytes , 260reads )
第一题:如果你觉得永远不能相遇请给出理由 大树下   (151 bytes , 341reads )
你确定? 掬水掇月   (121 bytes , 334reads )
上贴删除。。。 掬水掇月   (56 bytes , 312reads )
很久以前都做过了.. hash   (0 bytes , 268reads )
这两道题都有好几种解决方法:有些简单,有些复杂 大树下   (92 bytes , 256reads )