Forgot password? New user? Sign up
Existing user? Log in
What is the minimum number of straight segments needed in a single closed loop, in order to pass through a 3×3 square grid of points such that
This closed loop meets the requirements, but can we do with fewer segments?
Are you sure you want to view the solution?
a0=a and an+1=aan
What is the largest a such that an is convergent?
Are you sure you want to view the solution?
There are three 50-gallon drums. Initially,
While it still has water, Drum 1 empties into Drum 2 at a rate of 5 gallons per minute. While it still has water, Drum 2 empties into Drum 3 at a rate of 4 gallons per minute.
When Drum 2 reaches its maximum water level (though still not completely full), how many pounds of dissolved salt does it contain?
Assume that the salt water solutions are perfectly mixed at all times.
Are you sure you want to view the solution?
Three identical circles are packed in an ellipse, as shown. Let A,O,B be the centers of these circles (from left to right).
What is the angle ∠AOB such that the area of the ellipse is minimized?
Are you sure you want to view the solution?
Whenever Richard takes a step, he chooses one of the four cardinal directions at random and moves one unit in that direction. For a certain number of steps n, the probability of Richard starting at the origin and ending at the point (4,4) is maximized.
What is n?
Note: If you decide to use a more brute force solution to this problem, it is highly recommended and encouraged that you use a calculator and/or a bit of programming.
Are you sure you want to view the solution?
Problem Loading...
Note Loading...
Set Loading...