Descriptor
Mathematics Education | 4 |
Multiplication | 4 |
Mathematics Instruction | 3 |
Algebra | 2 |
Algorithms | 2 |
College Mathematics | 2 |
Computer Software | 2 |
Division | 2 |
Higher Education | 2 |
Mathematical Concepts | 2 |
Programing | 2 |
More ▼ |
Source
Computing Teacher | 1 |
Mathematics Teacher | 1 |
Mathematics and Computer… | 1 |
School Science and Mathematics | 1 |
Publication Type
Computer Programs | 4 |
Guides - Classroom - Teacher | 4 |
Journal Articles | 4 |
Reports - Descriptive | 1 |
Education Level
Audience
Practitioners | 2 |
Teachers | 2 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Harris, Judi – Computing Teacher, 1991
Arguing that mathematics is a form of communication that students need help in understanding, this article describes a set of seven simple interactive LogoWriter tools that can be used to help children explore the language of multiplication. Examples of the use of graphics in responding to children's commands are provided and several exercises are…
Descriptors: Computer Graphics, Computer Software, Elementary Education, Mathematics Education

Givan, Betty; Karr, Rosemary – Mathematics and Computer Education, 1988
The author presents two examples of lattice multiplication followed by a computer algorithm to perform this multiplication. The algorithm is given in psuedocode but could easily be given in Pascal. (PK)
Descriptors: Algorithms, College Mathematics, Computer Assisted Instruction, Computer Software

Hurd, Spencer P. – Mathematics Teacher, 1991
Presented is the ancient Egyptian algorithm for the operations of multiplication and division of integers and fractions. Theorems involving unit fractions, proved by Fibonacci, justifying and extending the Egyptian or Ahmes' methods into the Hindu-Arabic numeric representational system are given. (MDH)
Descriptors: Algebra, Division, Elementary Secondary Education, Fractions

Aslan, 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