Search Results for ""

Consider the probability Q_1(n,d) that no two people out of a group of n will have matching birthdays out of d equally possible birthdays. Start with an arbitrary person's ...

Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...

Given a group of n men arranged in a circle under the edict that every mth man will be executed going around the circle until only one remains, find the position L(n,m) in ...

Place a point somewhere on a line segment. Now place a second point and number it 2 so that each of the points is in a different half of the line segment. Continue, placing ...

In the early 1950s, Ernst Straus asked 1. Is every region illuminable from every point in the region? 2. Is every region illuminable from at least one point in the region? ...

Sangaku problems, often written "san gaku," are geometric problems of the type found on devotional mathematical wooden tablets ("sangaku") which were hung under the roofs of ...

Let n objects be picked repeatedly with probability p_i that object i is picked on a given try, with sum_(i)p_i=1. Find the earliest time at which all n objects have been ...

Let a in C and |a|<1, then phi_a(z)=(z-a)/(1-a^_z) is a Möbius transformation, where a^_ is the complex conjugate of a. phi_a is a conformal mapping self-map of the unit disk ...

Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).

A tree is planted at each lattice point in a circular orchard which has center at the origin and radius r. If the radius of trees exceeds 1/r units, one is unable to see out ...