Pizza and Problems/Pizza and Problems 3 (4/18/08)

From MSEnuxWiki

Jump to: navigation, search

Use this page to post solutions to our seventh Pizza and Problems session, held 4/18/08. Examine the original problem set.

A great time was had by all at our meeting of Pizza and Problems. We had some very cool problems, good pizza, and enthusiam and chuckles were high. Finally, we had some very good student presentations of solutions. Some students worked together on problems, arguing their case and developing ideas! A very cool strategy.

Contents

Student Solutions to the Problems in Pizza and Problems Set #3

Problem 1: Solution by:

Problem 2: Solution by:

Jonathan Gent stated that three points determine a circle and labeled the points as follows:

Image:Circle-1.gif

He then plugged each of the points A, D, and B into the equation of the circle, x2 + y2 = r2. This gave three equations in the unknowns a, b, and r, which he claimed was easily solvable. I checked. He's right and the answer is r=\sqrt{65}/2, making the diameter \sqrt{65}\,. Very cool solution.

Maybe some brave soul will provide the details?

Problem 3: Solution by: Bruce Wagner

The correct answer is 4/π2.

Start by dividing the unit circle in small pieces Pi, each of length Δθ. Note that the probability of p landing in any particular Pi is exactly (Δθ) / (2π).

Now given a choice of p = (a,b), let Pr(p) be the condition probability that the entire rectangle determined by p and q lies inside the circle. The rectangle will lie inside the circle precisely when q lies in the inscribed rectangle Rp determined by p, namely R_p=[-|a|,|a|]\times[-|b|,|b|]. Therefore, Pr(p) equals the ratio

\frac{\mbox{area of }R_p}{\mbox{area of the circle}}.

Since p = (cos(θ),sin(θ)) for some θ, the area of Rp is (2 | cos(θ) | )(2 | sin(θ) | ), and therefore,

\mbox{Pr}(p)=\frac{4|\cos(\theta)\sin(\theta)|}{\pi}

The last step is to choose points pi = (cos(θi),sin(θi)) in each subinterval and add up the conditional probabilities. The final probability is then approximately equal to the Riemann sum

\sum_{i=1}^{n} \frac{\Delta\theta}{2\pi}\cdot\frac{4|\cos(\theta_i)\sin(\theta_i)|}{\pi} =\sum_{i=1}^{n} \frac{2|\cos(\theta_i)\sin(\theta_i)|}{\pi^2}\Delta\theta

Taking the limit as \Delta\theta\to 0, we find that the final probability is

\int_0^{2\pi}\frac{2|\cos(\theta)\sin(\theta)|}{\pi^2}d\theta

Since the integrand has period π / 2, this is equal to

4\int_0^{\pi/2}\frac{2\cos(\theta)\sin(\theta)}{\pi^2}d\theta,

and a final calculation of this integral yields the final answer 4 / π2.

As there was some disagreement about this problem, I thought that I should check my answer using a simulation. This lead to a rather interesting programming problem. For the details, please see [1].

Problem 4: Solution by:

Problem 5: Solution by: David Arnold

In the following argument, we assume all numbers are integers. We define a \equiv b \pmod{n} if and only if n | ab, which means "n divides a - b".

Now, suppose that we know two things:

  1. a\equiv b\pmod n, and
  2. c\equiv d\pmod n.

These lead to the following two facts.

  1. n | ab, and
  2. n | cd.

Because n divides each of a - b and c - d, we have

  1. ab = k1n, and
  2. cd = k2n,

where k1 and k2 are integers. Multiply the first of these equations by c, the second by b to obtain the following results.

  1. acbc = k1cn, and
  2. bcbd = k2bn.

Adding these two equations produces the following result.

acbd = (k1c + k2b)n

Consequently, n | acbd and

ac\equiv bd\pmod n.

Hence, we have an important result. If a\equiv b\pmod n and c\equiv d\pmod n, then we can multiply left- and right-hand sides of these congruences together to produce the result ac\equiv bd\pmod n.

Now, onto our problem, finding the remainder when 21000 is divided by 13. It is easy to show that

2^6\equiv 12\pmod{13}.

That is, when 26 is divided by 13, the remainder is 12. Howeveer, 12\equiv -1\pmod{13}, so we can also say that

2^6\equiv -1\pmod{13}.

If we use our new property to multiply the left- and right-hand sides of this equivalence times themselves,

2^6\cdot 2^6\equiv (-1)\cdot(-1)\pmod{13},

or equivalently,

2^{12}\equiv 1\pmod{13}.

Now, it is easy to show that 1000 = 12(83) + 4. Hence,

2^{1000}=2^{12(83)+4}=\left(2^{12}\right)^{83}\cdot 2^{4}.

By our newly proven property of congruences,

\left(2^{12}\right)^{83}\cdot 2^4\equiv (1)^{83}\cdot 3\pmod{13}.

Hence,

2^{1000}\equiv 3 \pmod{13}.

Problem 6: Solution by:

Problem 7: Solution by:

Tami will love this construction. First, use 12 matches to craft a 3-4-5 triangle with area 6 square units.

Image:Matches.png

Now, we need to remove 2 square units.

Image:Matches2.png

A picture is worth a thousand words!

Wow!

Problem 8: Solution by:

Personal tools