Descriptor
| Prime Numbers | 4 |
| College Mathematics | 3 |
| Higher Education | 3 |
| Algorithms | 2 |
| Computation | 2 |
| Mathematics | 2 |
| Mathematics Instruction | 2 |
| Number Concepts | 2 |
| Numbers | 2 |
| Pattern Recognition | 2 |
| Computers | 1 |
| More ▼ | |
Source
| Mathematics and Computer… | 4 |
Publication Type
| Journal Articles | 4 |
| Guides - General | 2 |
| Guides - Classroom - Teacher | 1 |
| Reports - Descriptive | 1 |
Education Level
Audience
| Practitioners | 3 |
| Teachers | 1 |
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 reviewedBosse, Michael J. – Mathematics and Computer Education, 2001
This brief investigation exemplifies such considerations by relating concepts from number theory, set theory, probability, logic, and calculus. Satisfying the call for students to acquire skills in estimation, the following technique allows one to "immediately estimate" whether or not a number is prime. (MM)
Descriptors: Mathematics Education, Number Concepts, Prime Numbers, Probability
Peer reviewedJoyner, Virginia G.; Haggard, Paul W. – Mathematics and Computer Education, 1990
Discusses how to express an n factorial as a product of powers of primes. Provides two examples and answers. Presents four related suggestions. (YP)
Descriptors: Algorithms, College Mathematics, Computation, Division
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
