Search results
Results From The WOW.Com Content Network
Some trajectories of a particle in a box according to Newton's laws of classical mechanics (A), and according to the Schrödinger equation of quantum mechanics (B–F). In (B–F), the horizontal axis is position, and the vertical axis is the real part (blue) and imaginary part (red) of the wave function.
de Bruijn's theorem: A box can be packed with a harmonic brick a × a b × a b c if the box has dimensions a p × a b q × a b c r for some natural numbers p, q, r (i.e., the box is a multiple of the brick.) [15]
In the guillotine cutting problem, both the items and the "bins" are two-dimensional rectangles rather than one-dimensional numbers, and the items have to be cut from the bin using end-to-end cuts. In the selfish bin packing problem, each item is a player who wants to minimize its cost. [53]
The problem involves m balls and n boxes (or "bins"). Each time, a single ball is placed into one of the bins. Each time, a single ball is placed into one of the bins. After all balls are in the bins, we look at the number of balls in each bin; we call this number the load on the bin.
The critical temperature is the temperature at which a Bose–Einstein condensate begins to form. The problem is, as mentioned above, that the ground state has been ignored in the continuum approximation. It turns out, however, that the above equation for particle number expresses the number of bosons in excited states rather well, and thus:
For the particle in a box, it can be shown that the average position is always <x> = L/2, regardless of the state of the particle. The above statement is only true if the expectation is taken for an eigenstate. However, the most general state of a particle in a box is a linear combination of eigenstates.
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
There is a similar problem of finding long induced cycles in hypercubes, called the coil-in-the-box problem. The snake-in-the-box problem was first described by Kautz (1958), motivated by the theory of error-correcting codes. The vertices of a solution to the snake or coil in the box problems can be used as a Gray code that can detect single ...