![[header.gif]](../Images/header.gif)
Santa Clara University
High School Mathematics Talks
2006-2007
Santa Clara University
High School Mathematics Talks
2006-2007
![[fractal2.gif]](../Images/fractal2.gif)
The Department of Mathematics and Computer Science at Santa Clara University is pleased to offer mathematics enrichment talks for high school classes and mathematics clubs. Faculty members from the Department will be available to give entertaining and informative presentations designed to convey the joy of mathematical discovery and insight into why mathematics can be such an engrossing activity.
High school mathematics teachers may request a visit and schedule a time by contacting the speaker desired from the list below. Talks are generally planned to fit into a fifty-minute class period with time for discussion and questions. If a different amount of time is desired, this can be arranged with the speaker. The level for most talks can be adapted to take into account the background of the students present, but this also should be discussed with the speaker prior to the presentation.
Availability negotiable.
Topic: What Are the Chances? We present some interesting and controversial problems of probability, including the birthday problem, the Monte Hall problem, and the hanging problem. We will also discuss some card tricks and gambling strategies.
Availability negotiable.
Topic: Magnitized Thermal Rossby Waves. A short movie will be shown to demonstrate a magnitized thermal Rossby wave, that is a phenomenon which arises in the study of the flow of a heated fluid in the presence of a strong magnetic field. This type of flow occurs in such places as the heart of the sun, within a planet's core, and within a fusion reactor. Following the movie we will discuss some of the mathematical and computational tools used to study the structure of these waves.
Availability negotiable.
Topic: Number Tricks and Card Tricks You Can Do Yourself. In this presentation the speaker will show some number tricks and some card tricks. When magicians do tricks they seek to conceal why they work, but when mathematicians do tricks they seek to reveal why they work. Consequently all the tricks presented will be explained.
Availability negotiable.
Topic: Non-decimal Number Systems. We will look at the decimal number system with which we are all familiar and then show some number systems whose base is not ten. In particular, we will consider the bases two (binary), eight (octal), and sixteen (hexadecimal). We will discover an easy way to convert from one number system to another when one base is a power of another base.
Availability negotiable.
Topic: Eulerian Graphs and the Königsberg Bridges Problem. We'll look at figures and ask the following questions: Without lifting your pencil, and without going over any edge twice, can you trace these figures? Does it matter where you start? If you are able to trace them, can you do it if you have to start and end at the same point? Can you know the answer to any of these questions without tracing the figures?
Availability negotiable.
Topic Using Geometry to Solve Problems about Numbers. We will use an elliptic curve to solve the following problem: When is the product of two consecutive integers equal to the product of three consecutive integers? (This talk is accessible to any student familiar with the rudiments of graphing equations.)
Availability negotiable.
Topic: How Do We Know That the Earth Is Not a Donut? The surface of a ball and the surface of a donut are just two examples of surfaces on which a creature might live. We will discuss surfaces in general and how someone living on a particular surface might tell which kind of surface it is.
Availability negotiable.
Topic: Problems Even Computers Can't Solve. Computers are very good at calculations, but there are problems that even the most powerful computers cannot solve. We will look at some examples and their applications in protecting information on the Internet and fighting spam emails.
Last Updated: 8 October 2006
Maintainer: webmaster@math.scu.edu