You are not logged in.
Hi,
Yes, I did the same thing.
To convince myself it's the shortest path, I imagined an elastic string from (0,0) to (20,20), then slowly moved a circular obstacle against the string.
Nice one!
Hi bobbym,
Do you have a library at home or do you live in a library?
Wow! You seem to be having a good collection of books.
Hi,
There is a book dedicated to this topic.
"Chases and escapes: the mathematics of pursuit and evasion"
By Paul J. Nahin
You may check few pages in google books
Ok, thanks for letting me know the name.
I'll search for some materials related to it. It was difficult without knowing the keywords!
Hi bobbym,
Thanks for the link.
I knew of the formula, and but cannot recall the site from where I read. That site too only cited the formula.
I tried hard to derive the formula, but couldn't. Then I posted it here!
I'm hoping someone may work it out here
Hi,
You may be familiar with this puzzle.
Consider a regular polygon with n sides, and side length 'a'.
There's an ant at each vertex. Every ant moves in one direction(all left or all right) towards the nearest ant in that direction, all at the same,constant speed. They move until they meet. What is the distance traveled by each ant?
Hi ganesh,
Nice
Thanks!
Oh, can generating function be used for constant weight on one pan? Please tell me about it...
Hi,
It is a Partition problem, isn't it?
Hi bobbym,
I was getting a feeling whether it was a bot for flaming!
http://en.wikipedia.org/wiki/Chatterbot
And for that weights' problem, is there a way other than brute force?
Hi bobbym,
I read it everywhere - "DO NOT FEED THE TROLL"
http://en.citizendium.org/wiki/Internet_troll#Psychology_of_trolls
Whew! I thought I understood the question wrong when you asked that!
Congratulations Euler!!
Hi,
After A and B eat, 1/3rd of pie is left, right?! Otherwise I might have misunderstood the problem.
Hi bobbym,
Who eats the pie?
A,B,C,D and E decide to stop arguing and to do something together for a change. B's Mom bakes them a big pie to celebrate their togetherness. Before they start to eat they begin to argue about primes. They are mathematically inclined after all. They settle down on this one particular question.
If we start with the set of all fractions with 1 as the numerator and all the primes as denominators ( { 1 / 2, 1 / 3, 1 / 5, 1 / 7, 1 / 11, ...} and each of us starting with A and in order ( A,B,C,D,E, A,B,C,D,E... ) takes the next fraction and eats that amount of the remaining pie. In other words A eats 1 / 2, B eats 1 / 3 of the remaining half, C eats 1 / 5 of the remaining sixth... When we get to E and if there is more pie left we start again with A. The question is will we ever finish the pie?
A says) Since this can go on forever I think there will always be some pie left.
B says) Not necessarily sometimes an infinite process can equal a finite number. I think the pie will eventually be consumed.
C says) Who cares I am hungry.
D says) No wait, I think I read about something like this called Zeno's paradox.
E says) Hey D, did you make that up?
The answer depends on whether the product
converges or notAfter googling for such a product, I came across the beautiful Euler's product formula for Riemann zeta function-
Taking s=1, we are assured that the pie is completely eaten, but I wonder who gets the last piece!
I understood what you said, I just typed in a hurry
Yes, I saw some problems were never attempted and some were attempted after a few weeks. I'm surprised that there are so many registered users, yet a handful of them ever login!
Yes, some are easy problems in disguise.
I'll try them in my free time.
Hi,
I was going through all pages of this thread and saw that some problems were not attempted.
I could not resist that probability problem.
Thanks again for all the beautiful problems.
Hi bobbym,
Ah, yes I get it. Thanks! Nice one...
Ok, It's a doubtful answer of mine. So I may be wrong...
No urgency, take your time.