NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 3 results Save | Export
Peer reviewed Peer reviewed
Johnson, R. W.; Waterman, M. S. – International Journal of Mathematical Education in Science and Technology, 1976
In a thesis written for the Doctor of Arts in Mathematics, the connection between Euclid's algorithm and continued fractions is developed and extended to n dimensions. Applications to computer sciences are noted. (SD)
Descriptors: Algorithms, College Mathematics, Computers, Doctoral Dissertations
Peer reviewed Peer reviewed
Davies, H. B. – International Journal of Mathematical Education in Science and Technology, 1980
Attention is drawn to an ancient Greek method for finding the least common multiple (LCM) of two numbers. A link is established between this method and a well-known method of obtaining the highest common factor (HCF) numbers. This leads to consideration of some relationships between HCF and LCM. (Author/MK)
Descriptors: Algorithms, Mathematical Formulas, Mathematics Curriculum, Mathematics Instruction
Peer reviewed Peer reviewed
Bryll, Grzegorz; Rabijewska, Barbara – International Journal of Mathematical Education in Science and Technology, 1980
The theory of unary and binary operations are discussed and illustrated with examples from school mathematics. Presentations of selected inverse operations are made and attention is drawn to certain "typical" problems that occur during instruction and learning of these concepts. (MP)
Descriptors: Algorithms, College Mathematics, Learning Problems, Mathematical Concepts