Descriptor
| College Mathematics | 5 |
| Higher Education | 5 |
| Mathematics | 5 |
| Mathematics Instruction | 5 |
| Number Concepts | 4 |
| Proof (Mathematics) | 3 |
| Number Systems | 2 |
| Pattern Recognition | 2 |
| Prime Numbers | 2 |
| Algorithms | 1 |
| Computation | 1 |
| More ▼ | |
Source
| Mathematics and Computer… | 5 |
Publication Type
| Guides - General | 5 |
| Journal Articles | 5 |
Education Level
Audience
| Practitioners | 4 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedTravis, David L. – Mathematics and Computer Education, 1983
A student noticed an interesting fact about the base two numerals for perfect numbers. Mathematical explanations for some questions are given. (MNS)
Descriptors: College Mathematics, Computers, Higher Education, Mathematics
Peer reviewedDence, Thomas P. – Mathematics and Computer Education, 1983
Representation of integers in various bases is explored, with a proof. (MNS)
Descriptors: College Mathematics, Higher Education, Integers, Mathematics
Peer reviewedMetz, James – Mathematics and Computer Education, 1984
A study of a class of numbers called 'Good numbers' can provide students with many opportunities for investigation, conjecture, and proof. Definitions and proofs are presented along with suggested questions. (MNS)
Descriptors: College Mathematics, Discovery Learning, Higher Education, Mathematics
Peer reviewedBaumback, Randall R. – Mathematics and Computer Education, 1984
The historical origin of star-polygons is noted and the mathematics of them presented, with illustrations. Seven theorems are included, as well as a computer program designed to classify star-polygons. (MNS)
Descriptors: College Mathematics, Higher Education, Mathematical Enrichment, Mathematics
Peer reviewedLevine, Deborah – Mathematics and Computer Education, 1983
The Euclidean algorithm for finding the greatest common divisor is presented. (MNS)
Descriptors: Algorithms, College Mathematics, Computation, Higher Education
