Recent content by LENIN

Your 2 examples seam to work OK but the generalization doesn't. I will see if I can do something with it. There is also still the problem if m doesn't equal n. If m<n the solution is trivial (the game can not end).

No, we choose which pair to randomize at random. And we repeat the proces until there are no more pairs. Yes. We allways choose pairs at random (if there are any ofcourse). Each time we randomize a pair.

This question is part of a larger problem I'm working on, but it seams to be causing me the most problems. Any help or tip would be appreciated. So here it goes. We have n objects which can have any of the m allowed values. If we find a pair of objects with equal values, we change their values...

My favorite is: 1999 The Bicentennial Man

Around 180 (90 in the first year and 30 in the second, third and forth).

If you selected the people corectly (none have birthdays on the same day) then one for each day would be enogh. If you selected people for your group at rendom then I don't think that you can ever be 100% certine (no mether how large the group is).

I would calculate the deadly amount of sweetener per unit of mass (from the firtst 2 inputs). If you multiply this with the third input you get the deadly amount of sweetener for the dieter. Multiplying the resoult by 100 should give you the amount of soda.

I tride this myself yesterday and there is really a quite a large collection of problems here (but they are solvable). 1. First of all I just ride to evolute the function: FourierTransform[Cos[3000 t], t, ω] I't took a long time so I advice you don't use 3000 but something smaller perhaps...

Yes Mathemathica really wotks great for calculations like this. But there are other good way's of doing it as well. I have in the past also did stuff like this with the Smalltalk programming language (it isn't very good for doing mathemathics but it does enable arbitrary-precision arithmetic)...

Pencil I believe that your probleme (aside from the squares) was that 1000m=1km and not 1000km=1m.

The Chop function might allso help. Take a look http://documents.wolfram.com/mathematica/book/section-3.1.4" .

I am not 100% sure about this but you might want to use the RealOnly Add-On. http://documents.wolfram.com/v5/Add-onsLinks/StandardPackages/Miscellaneous/RealOnly.html" is a link that shoul tell you how tu use it. I hope it helps.

Maybe you could try the ToString function (checkout: http://documents.wolfram.com/v4/RefGuide/ToString.html" for more information).

I read Scientific American and a two local magazines (one of a more scientific and one of a more political nature).

I passed the theoretical part the first time. But it took me three times to do the prectical part. For me the hardest part was shifting the gears and looking at the mirrors every 3-5 seconds (thazt just sounded stupid on a compleatly diserted road).