Descriptor
| Algorithms | 3 |
| Problem Sets | 3 |
| College Mathematics | 2 |
| Computation | 2 |
| Division | 2 |
| Higher Education | 2 |
| Mathematical Applications | 2 |
| Addition | 1 |
| Algebra | 1 |
| Geometric Constructions | 1 |
| Geometry | 1 |
| More ▼ | |
Publication Type
| Journal Articles | 3 |
| Reports - Descriptive | 2 |
| Computer Programs | 1 |
| Guides - Classroom - Teacher | 1 |
Education Level
Audience
| Practitioners | 3 |
| Teachers | 3 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedPollak, Henry – Australian Mathematics Teacher, 1989
Possible ways of mechanization for counting using a binary system are discussed. Shows a binary representation of the numbers and geometric models having eight triples of lamps. Provides three problem sets. (YP)
Descriptors: Algorithms, Computation, Geometric Constructions, Geometry
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 reviewedAslan, Farhad; Duck, Howard – School Science and Mathematics, 1992
P-adic or g-adic sets are sets of elements formed by linear combinations of powers of p, a prime number, or g, a counting number, where the coefficients are whole numbers less than p or g. Discusses exercises illustrating basic numerical operations for p-adic and g-adic sets. Provides BASIC computer programs to verify the solutions. (MDH)
Descriptors: Addition, Algebra, Algorithms, College Mathematics
