Professional Documents
Culture Documents
Problemas Geometria 1
Problemas Geometria 1
EDU
Received: from [199.164.164.1] by MIT.EDU with SMTP
id AA07942; Sat, 20 Apr 96 14:13:01 EDT
Received: by questrel.questrel.com (940816.SGI.8.6.9/940406.SGI)
for news-answers-request@mit.edu id LAA25270; Sat, 20 Apr 1996 11:13:50 -0700
Newsgroups: rec.puzzles,news.answers,rec.answers
Path: senator-bedfellow.mit.edu!bloom-beacon.mit.edu!spool.mu.edu!howland.reston.ans.net!eu
From: chris@questrel.questrel.com (Chris Cole)
Subject: rec.puzzles Archive (geometry), part 13 of 35
Message-Id: <puzzles/archive/geometry/part1_745653851@questrel.com>
Followup-To: rec.puzzles
Summary: This is part of an archive of questions
and answers that may be of interest to
puzzle enthusiasts.
Part 1 contains the index to the archive.
Read the rec.puzzles FAQ for more information.
Sender: chris@questrel.questrel.com (Chris Cole)
Reply-To: archive-comment@questrel.questrel.com
Organization: Questrel, Inc.
References: <puzzles/archive/Instructions_745653851@questrel.com>
Date: Wed, 18 Aug 1993 06:05:22 GMT
Approved: news-answers-request@MIT.Edu
Expires: Thu, 1 Sep 1994 06:04:11 GMT
Lines: 1475
Xref: senator-bedfellow.mit.edu rec.puzzles:24997 news.answers:11517 rec.answers:1917
Apparently-To: news-answers-request@mit.edu
Archive-name: puzzles/archive/geometry/part1
Last-modified: 17 Aug 1993
Version: 4
The proofs that K5 and K3,3 are non-planar are really quite easy, and
only depend on Euler's Theorem that F-E+V=2 for a planar graph. For
K3,3 V is 6 and E is 9, so F would have to be 5. But each face has at
least 4 edges, so E >= (F*4)/2 = 10, contradiction. For K5 V is 5 and
E is 10, so F = 7. In this case each face has at least 3 edges, so E >=
(F*3)/2 = 10.5, contradiction.
The usual quibble is to solve the puzzle by running one of the pipes
underneath one of houses on its way to another house; the puzzle's
instructions forbid crossing other *pipes*, but not crossing other *houses*.
There is another place (actually a whole set) on earth from which one
can go fifty miles south, fifty miles west, and fifty miles north and
end up where one started. Consider the parallel of latitude close
enough to the South Pole that its length is 50/n miles, for some
integer n.
Take any point on that parallel of latitude and pick the point fifty miles
north of it. Situate the hunter's front porch there. The hunter goes fifty
miles south from his porch and is at a point we'll call A. He travels fifty
miles west, circling the South Pole n times, and is at A again, where he shoots
the bear. Fifty miles north from A he is back home. Since bears are not
indigenous to the Antarctic, again the bear is either imaginary or imported
and there is no telling what color it might be.
A
/ \
/ \
D E XP normal to AB
/ \ / \ XQ normal to AC
P /----X----\ Q
/ / \ \
/ / \ \
/ / \ \
B/_______________\C
PROOF :
Let XP and XQ be normals to AC and AB.
Since the three angle bisectors are concurrent, AX bisects angle A
also and therefore XP = XQ.
Hence XD = XE => CX = BX
From which it is easy to prove that the triangle is isosceles.
Now came the fun part. The a was placed so I had to work around
it for the other months that had an a in them (mar, apr, may).
m a r
d/p y (2)
Now the d/p was placed so I had to work around that for sep and dec.
This one was easy since they shared an e as well.
d/p e s
c (3)
The two months left (oct, nov) were far more complex. Not only
did they have two "set" letters (c, n/u), there were two possible n/u's
to be set with. That's why I left them for last.
o t c
n/u v (5)
j a n/u a b e
g n/u l or, c d/p g
r s m alphabetically: f l j
y c d/p n/u m o
e v t s n/u r
o f b v t y
Without some gimmick the days cannot be done. Because of the dates 11 and
22, there must be a 1 and a 2 on each cube. Thus there are 8 remaining spaces
for the 8 remaining numbers, and because of 30, we put 3 and 0 on different
cubes. I don't think the way you allocate the others matter. Now 6 numbers on
each cube can produce at most 36 distinct pairs, and we need 31 distinct pairs
to represent all possible dates. But since 3 each of {4,5,6,7,8,9} are on each
cube, there are at least 9 representable numbers which can't be dates.
Therefore there are at most 27 distinct numbers which are dates on the two
cubes, and it can't be done. In particular, not all of {04,05,06,07,08,09} can
be represented.
There is only one way to remove a square, aside from rotations and
reflections. To see that there is at most one way, do this: Label
all the squares of the chessboard with A, B or C in sequence by rows
starting from the top:
ABCABCAB
CABCABCA
BCABCABC
ABCABCAB
CABCABCA
BCABCABC
ABCABCAB
CABCABCA
Every triomino must cover one A, one B and one C. There is one extra
A square, so an A must be removed. Now label the board again by
rows starting from the bottom:
CABCABCA
ABCABCAB
BCABCABC
CABCABCA
ABCABCAB
BCABCABC
CABCABCA
ABCABCAB
The square removed must still be an A. The only squares that got
marked with A both times are these:
........
........
..A..A..
........
........
..A..A..
........
........
Reset the compass to its original size. From P2 and P4 draw a circle
(C4 and C5). These circles intersect at P6 and P1. Connect P6, P2,
P1, P4 for a square of the same size as the original compass setting.
d(length)/d(theta)
= A*sin(theta)/cos(theta)^2 - B*cos(theta)/sin(theta)^2 (?)
= 0
A*sin(theta)/cos(theta)^2 = B*cos(theta)/sin(theta)^2
theta = inverse_tan(cube_root(B/A))
(A^(2/3) + B^(2/3))^(3/2)
dV / dr = 4 * pi * r^2
dA / dr = 8 * pi * r
dV / dA = (dV / dr) / (dA / dr)
= (4 * pi * r^2) / (8 * pi * r)
= r/2
= 3,250,000 m
tetrahedron: (x1^4+3x2^2+8x1*x3)/12
cube: (x1^6+6x2^3+3x1^2*x2^2+8x3^2+6x1^2*x4)/24
octahedron: (x1^8+9x2^4+8x1^2*x3^2+6x4^2)/24
dodecahedron: (x1^12+15x2^6+20x3^4+24x1^2*x5^2)/60
icosahedron: (x1^20+15x2^10+20x1^2*x3^6+24x5^4)/60
tesseract: (32x6^4+x2^12+48x8^3+x1^24+24x1^2*x2^11+12x2^2*x4^5+32x3^8+12x4^6
+18x1^4*x2^10+12x1^4*x4^5)/192
Except for #3, all of these partitions can be achieved by breaking up the
hexagon into unit equilateral triangles, and then building these into the
shapes desired. For #3, though, this would require (since there are 24 small
triangles) trapezoids formed from 6 triangles each. The only trapezoid that
can be built from 6 identical triangles is a parallelogram; I assume that the
poster wouldn't have asked for a trapezoid if you could do it with a special
case of trapezoid. At any rate, that parallelogram doesn't work.
Method M1:
The diameters of the semicircles have to be on the longer sides,
starting at an endpoint of the rectangle. The two semicircles touch
each other in the middle M of the rectangle.
a
D._______________________.C
| |
| |
b | . M |
| |
| |
|_______.___.___________|
A R X B
Method M2:
We'll cut on the line y = c x, where c will turn out to be slightly
less than d, the slope of the diagonal. We describe the semicircle
lying above the line y = c x, having this line as the straight part of
the semi-circle. The center P of the semicircle will be taken on the
line y = d - x, and will be tangent to the left and top of the
rectangle. Clearly the lower down P is on this line, the better. The
naive solution is not optimal because the upper place where the
semicircle meets the diagonal is interior to the rectangle. So we try
to determine c in such a way that this latter point actually lies
slightly down from the top, on the right side of the rectangle. This
involves solving the quartic:
4r^4 - (4a+16b)r^3 + (16b^2+a^2+8ab)r^2 - (6b^3+4ab^2+2ba^2)r + b^4+(ab)^2 = 0,
where r < b, the details of which will be left to the reader.
The other semicircle is the reflection of the first through the origin.
+----------------+-------------+----------------------+---------------------+
| | | | |
| | | | |
| | 11 | | |
| | | | |
| 16 | | | |
| +-----+--+----+ 22 | 21 |
| | | 2| | | |
| | 5 +--+----+ | |
| | | | | |
+----------------+--+--+ 6 | | |
| | 3| | | |
| ++-+-------+ | |
| || | ++--------------------+
| || 8 +----------------------++ |
| 18 || | | |
| || | | |
| ++---------+ | |
| | | | 20 |
| | 9 | | |
+------------------++ | 23 | |
| || | | |
| ++----------+ | |
| | | +---++---------------+
| | | | || |
| 17 | 10 | | 4 || |
| | +---------------+-------+---++ |
| +-+---------+---------------+ | 15 |
| | | | | |
| | | | 12 | |
+------------------+-+ | +-+-------------+
| | | |1| |
| | +------------+-+ |
| | 24 | | |
| | | | |
| 19 | | 13 | 14 |
| | | | |
| | | | |
| | | | |
+--------------------+-------------------------+--------------+-------------+
5. Divide the original square into 4 equal squares whose sides are
parallel to the sides of the original square.
How much faster must the fox run that the duck swims in order to be always
able to catch the duck?
3. Observe which way the fox has started to run around the circle.
Turn at a RIGHT ANGLE in the opposite direction (i.e. if you started
swimming due south in step 2 and the fox started running to the east,
i.e. clockwise around the pond, then start swimming due west). (Note:
If at the beginning of step 3 the fox is still in the same location as
at the start of step 2, i.e. directly opposite you, repeat step 2
instead of turning.)
4. While on your new course, keep track of the fox. If the fox slows
down or reverses direction, so that you again become diametrically
opposite the fox, go back to step 2. Otherwise continue in a straight
line until you reach the bank.
5. Fly away.
around the circle. In the limit as delta goes to 0, the duck will
escape as long as
that is,
"But wait," I hear you cry, "When the duck heads off to that spot
'more than halfway' around the circle, why doesn't the fox just double
back? That way he'll reach that spot much quicker." That is why the
duck's strategy has instructions to repeat step 2 under certain
circumstances. Note that at the end of step 2, if the fox has started
to run to head off the duck, say in a clockwise direction, he and the
duck are now on the same side of some diameter of the circle. This
continues to be true as long as both travel along their chosen paths
at full speed. But if the fox were now to try to reach the duck's
destination in a counterclockwise direction, then at some instant he
and the duck must be on a diameter of the pond. At that instant, they
have exactly returned to the situation that existed at the end of step
1, except that the duck is a little closer to the edge than she was
before. That's why the duck always repeats step 2 if the fox is ever
diametrically opposite her. Then the fox must commit again to go one
way or the other. Every time the fox fails to commit, or reverses his
commitment, the duck gets a distance delta closer to the edge. This
is a losing strategy for the fox.
Given a ratio R of speeds less than the above a, the fox is sure to
catch the duck (or keep it in water indefinitely) by pursuing the
following strategy:
Do nothing so long as the duck is in a radius of R around the centre.
As soon as it emerges from this circle, run at top speed around the
circumference. If the duck is foolish enough not to position itself
across from the center when it comes out of this circle, run "the short
way around", otherwise run in either direction.
2 2
area of donut = pi * R - pi * r
2 2
= pi * (R - r )
Draw a right triangle and apply the Pythagorean Theorem to see that
2 2 2
R - r = (D/2)
so the area is
2
= pi * (D/2)
Start with a sphere of radius R (where R > 6"), drill out the 6"
high hole. We will now place this large "ring" on a plane. Next to it
place a 6" high sphere. By Archemedes' theorem, it suffices
to show that for any plane parallel to the base plane, the cross-
sectional area of these two solids is the same.
so the area is
pi * ( 3^2 - h^2 )
For the ring, once again we are looking at the area between two concentric
circles. The outer circle has radius sqrt(R^2 - h^2),
The area of the outer circle is therefore
pi (R^2 - h^2)
pi * ( R^2 - 3^2 )
Therefore the areas are the same for every plane intersecting the solids.
Therefore their volumes are the same.
QED
0-v: 4,096
1-v: 24,576
2-v: 67,584
3-v: 112,640
4-v: 126,720
5-v: 101,376
6-v: 59,136
7-v: 25,344
8-v: 7,920
9-v: 1,760
10-v: 264
11-v: 24
12-v: 1
Kissing Numbers
+---+---+---+
| | | |
+---+-+-+---+
| | |
+-----+-----+
Turn each "room" into a point. Turn each line segment into a line
connecting the two points representing the rooms it abuts. You should
be able to see that drawing one continuous line across all segments in
your drawing is equivalent to traversing all the edges in the resulting
graph. Euler's Theorem states that for a graph to be traversable, the
number of vertices with an odd number of edges proceeding from them
must be either zero or two. For this graph, that number is four, and it
cannot be traversed.
+---+---+---+
| 1 | 2 | 3 |
+---+-+-+---+ 6 (outside)
| 4 | 5 |
+-----+-----+
1: 4
2: 5 (*odd*)
3: 4
4: 5 (*odd*)
5: 5 (*odd*)
6: 9 (*odd*)
To prove Euler's Theorem, think of walking along the graph from vertex to
vertex. Each vertex must be entered as many times as it is exited, except
for where you start and where you end. So, each vertex must have an
even number of edges, except possibly for two vertices. And if there are
two vertices with an odd number of edges, the path must start at one and
end at the other.
B D
|\ L1 L2 /|
| \ / | BC = length of L1
| \ / | AD = length of L2
| \ O / | s = height of intersection
x| \ / |y A = (0,0)
| /|\ | AE = a
| m / | \ n | EC = b
| / |s \ | AO = m
| / | \ | CO = n
|/________|________\|
(0,0) = A a E b C
-----------------------------------------------------------------------------
Without loss of generality, let L2 >= L1.
Observe that triangles AOB and DOC are similar. Let r be the ratio of
similitude, so that x=ry. Consider right triangles CAB and ACD. By
the Pythagorean theorem, L1^2 - x^2 = L2^2 - y^2. Substituting x=ry,
this becomes y^2(1-r^2) = L2^2 - L1^2. Letting L= L2^2 -L1^2 (L>=0),
and factoring, this becomes
L1 and L2 are given, and so L is a constant. How large can s be? Given L,
the value s=k is possible if and only if there exists a real solution, y',
to (***), such that 2k <= y' < L2. Now that s has been chosen, L and s are
constants, and (***) gives the desired value of y. (Make sure to choose the
value satisfying 2s <= y' < L2. If the value of s is "admissible" (i.e.,
feasible), then there will exist exactly one such solution.)
Now, w = sqrt(L2^2 - y^2), so this concludes the solution.
Suppose 2 of the vertices are (a,b) and (c,d), where a,b,c,d are integers.
Then the 3rd vertex lies on the line defined by
FF I L N PP TTT U U V V W W W X X Y ZZ
FF I L NN PP T UUU V V W W X YY Z
F I L N P T V X X Y ZZ
I LL N Y
UUXPPPZYYYYWTFNNNVVV
UXXXPPZZZYWWTFFFNNLV
UUXIIIIIZWWTTTFLLLLV
A 4x15 solution:
IIIIINNLLLLTVVV
UUXNNNFZZWLTTTV
UXXXYFFFZWWTPPV
UUXYYYYFZZWWPPP
NFVVV YYYYI
NFFFV LLYZI
NNFXV LZZZI
PNXXX LZWTI
PPUXU LWWTI
PPUUU WWTTT
The 2x3x10 and 3x4x5 solutions are tricky to show - I hope these diagrams
make sense:
VVVZIIIIIF UUXTTTWWPP
VZZZNNNFFF UXXXTWWPPP
VZYYYYNNFL UUXYTWLLLL
--
+------------------- pete@bignode.equinox.gen.nz -------------------+
| The effort to understand the universe is one of the very few things |
| that lifts human life above the level of farce, and gives it some |
| of the grace of tragedy - Steven Weinberg |
+---------------------------------------------------------------------+
2^n . 72 / ((n+3)(n+4)(n+6))
The question will become a lot easier if you restate it as the following:
What is the probability in finding at least one point such that all the other
points on the sphere are on one side of the great circle going through this
point.
Imagine you are rolling a wheel by pushing it along the equator of the
earth. Suppose the circumference of the wheel is one third of that of
the earth. By the time you return to your starting point, the wheel
finishes 3 revolutions relative to you. But do not forget you yourself
also finishes 1 revolution in the same direction. As a result, the
number of absolute revolutions is 3+1=4.
But if the small circle is rolling inside the large circle, the answer
is then 3-1=2, because in this case the wheel makes a counter-revolution
as you walk once around.
Hospitals have machines which take out your blood, centrifuge it to take out
certain parts, then return it to your veins. Because of AIDS they must never
let your blood touch the inside of the machine which has touched others'
blood. So the inside is lined with a single piece of disposable branched
plastic tubing. This tube must rotate rapidly in the centrifuge where
several branches come out. Thus the tube should twist and tangle up the
branches. But the machine untwists the branches as in the above discussion.
At several hundred rounds per minute!
References
R. Penrose and W. Rindler
Spinors and Space-time, vol. 1, p. 43
Cambridge University Press, 1984
M. Gardner
The New Ambidextrous Universe, Revised (Third) Edition, pp. 329-332
W. H. Freeman, 1990
G may change course and speed at will. He knows his own speed and
course at all times. There is no wind, G does not have radio or radar,
there is enough space for maneuvering, etc.
G waits until he knows that S has traveled for one mile. At that time, both
S and G are somewhere on a circle with radius one mile, and with its center
at the original position of S. G then begins to travel with a velocity that
has a radially outward component equal to that of S, and with a tangential
component as large as possible, given G's own limitation of total speed. By
doing so, G and S will always both be on an identical circle having its
center at the original position of S. Because G has a tangential component
whereas S does not, G will always catch S (actually, this is not proven
until you solve the o.d.e. associated with the problem).
If G can go at 40 mph and S goes at 20 mph, you can work out that it will
take G at most 1h 49m 52s to catch S. On average, G will catch S in:
If one heads northwest continuously, one will spiral closer and closer
to the North Pole, until finally one can't turn that sharply.
This leads to
The latter number is the radius of a table that has a point which
satisfies the conditions but is not on the quarter circle nearest
the corner.
[Exercises:
0) Why does this work for M*N odd?
1) When M<3 the count can be determined directly;
check that it agrees with the above formula.
2) Prove directly this formula gives an integer for all M,N, and
further show that if M=N it is a perfect square when 4|N and
twice a square otherwise.
]
Where does this come from? For starters note that, with the usual checker-
board coloring, each domino must cover one light and one dark square. Assume
that M*N is even (but as it happens our formula will work also when both
M,N are odd --- see exercise 0 above). Form a square matrix of size
M*N/2 whose rows and columns are indexed by the light and dark squares,
and whose (j,k) entry is 1 if the j-th light and k-th dark square are
adjacent and zero otherwise. There are now three key ideas:
First, the number of tilings is the number of ways to match each light
square with an adjacent dark square; thus it is the _permanent_ of our
matrix (recall that the permanent of a rxr matrix is a sum of the same
r! terms that occur in its determinant, except without the usual +1/-1
sign factors).
Third, that we can diagonalize the resulting matrix A --- or, more
conveniently, the square matrix of A' order M*N whose order-(M*N/2)
blocks are 0,A;A-transpose,0 , whence det(A') = +-(det(A))^2. Then
the rows and columns of A' are indexed by squares of either hue on our
generalized checkerboard, and its entries are 1 for horizontally adjacent
squares, i for vertically adjacent ones, and 0 for nonadjacent (including
coincident) squares. This A' can be diagonalized by using the trigonometric
basis of vectors v_ab (a,b as in the formula above) whose coordinate at
the (m,n)-th square is sin(a*m*pi/(M+1)) * sin(b*n*pi/(N+1)).