|
Primes and Composites (Math Chat)

Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help

| http://www.maa.org/features/mathchat/mathchat_6_2_00.html | |
|
|
|
| Frank Morgan, MAA Online | |
| Answering the challenge: Consider the sequence of integers 10n + 1: 11, 101, 1001, ... Are there infinitely many primes? Infinitely many composite numbers? Whenever n is odd, 10n + 1 is divisible by 11. Modulo 11, 10n + 1 = (-1)n + 1 = 0 if n is odd, so there are infinitely many composite numbers. It seems to be an open question whether there are infinitely many primes... New challenge: What is the shortest line segment fencing off prescribed area 0 < A < 1 in a unit square? (What about the least-area piece of plane dividing off prescribed volume 0 < V < 1 in a unit cube? What about a 4D cube?) | |
|
|
|
| Levels: | High School (9-12), College |
| Languages: | English |
| Resource Types: | Articles |
| Math Topics: | Number Sense/About Numbers, Prime Numbers |
[Privacy Policy] [Terms of Use]


© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.