BMAD

walk back out slowly

In looking at TimeSpaceLightForce's question on Particles, I was reminded of Prince Rupert's cube. In this problem, it is shown that a cube larger than a unit cube can in fact successfully pass through a unit cube. This problem is now being put forth to a tetrahedron to see if the same applies. http://en.wikipedia.org/wiki/Prince_Rupert's_cube

visual basic

but cougars don't like to go near human urine.

I would pee a line separating between me and the cougar(s)

Suppose you are in a contest with another player. The gameshow created a holographic regular tetrahedron with each edge at 1 inch. Your job is to make the largest possible tetrahedron and throw it threw the hologram. The catch is that the tetrahedron you make must also be regular and must completely go through the hologram, so that every part of your shape must make it through the hologram. You pick the orientation of the holographic tetrahedron. The largest tetrahedron to make it through the holographic tetrahedron wins! Assume that your shape does not rotate when it leaves your hands and that the hologram also does not rotate once you set its orientation.

Go inside in a cave.

brilliant observation

clarification

Can you find a more optimal way?

darn. This is why i prefer to write my own questions. I am always making simple mistakes like this.

I strongly dislike AutoCAD so many rough memories

Find the smallest positive integer such that if the ones digit is moved (from the right) all the way to the left, the resulting number is exactly 50% more than the original number.

How do you know this?

Call the altitudes of a triangle: h , k , m; and the radius of its inscribed circle: r. Find the minimum value of the expression (h + k + m) / r (over all triangles). Which triangle achieves this minimum?

My old toaster can hold at most two slices of bread and toast them on one side at a time. I want my bread toasted on both sides and buttered on one side. It takes 3 seconds to put each slice into the toaster, 30 sec to toast one side of 1 or 2 slices, 3 sec to reverse a slice, and 12 sec to butter one (that side must already be toasted). Assume only one of these operations can be done at a time. In how short a time can I toast & butter three slices?

Find the values of the bricks. Each brick is the sum of the two bricks below it and L is 5 more than J.

Driving out in the "Western Plains" states of the U.S. is like being on a flat plane. Three trees are now growing at random points on the plane (or plain). What's the probability they form an obtuse triangle? Assume that two of the trees are a fixed distance 'x' from each other.

Closer but Superprismatic was more exact.

Please explain your answer.

nice try Dark Magician