Comparing the structure of algorithms: The case of long division and log division - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Comparing the structure of algorithms: The case of long division and log division

Résumé

This paper is a theoretical contribution to the comprehension of logarithms by means of comparing algorithms. First an algorithmic approach to the logarithm (so-called log division) is introduced, which then is compared with the standard division algorithm (long division). By working out mathe-matical correspondences and differences between the two algorithms, this approach focuses on structural aspects of two mathematical operations and their relations. Comparing algorithms in classrooms is proposed as a way of algorithmic thinking that would go beyond rote memorization.
Fichier principal
Vignette du fichier
TWG03_25.pdf.pdf (565.18 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02416486 , version 1 (17-12-2019)

Identifiants

  • HAL Id : hal-02416486 , version 1

Citer

Christof Weber. Comparing the structure of algorithms: The case of long division and log division. Eleventh Congress of the European Society for Research in Mathematics Education, Utrecht University, Feb 2019, Utrecht, Netherlands. ⟨hal-02416486⟩

Collections

TICE CERME11
128 Consultations
199 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More