On the Existence of Balanced Chain Rule Task Sets
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916948259897344 |
|---|---|
| author | Gilroy, Haile |
| author_facet | Gilroy, Haile |
| contents | In mathematics education research, mathematics task sets involving mixed practice include tasks from many different topics within the same assignment. In this paper, we use graph decompositions to construct mixed practice task sets for Calculus I, focusing on derivative computation tasks, or tasks of the form "Compute $f'(x)$ of the function $f(x)=$ [elementary function]." A decomposition $D$ of a graph $G=(V,E)$ is a collection $\{H_1, H_2, ... , H_t\}$ of nonempty subgraphs such that $H_i=G[E_i]$ for some nonempty subset $E_i$ of $E(G)$, and $\{E_1, E_2, ... , E_t\}$ is a partition of $E(G)$. We extend results on decompositions of the complete directed graph due to Meszka and Skupień to construct balanced task sets that assess the Chain Rule. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_13253 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Existence of Balanced Chain Rule Task Sets Gilroy, Haile Combinatorics 05B30, 97I40 In mathematics education research, mathematics task sets involving mixed practice include tasks from many different topics within the same assignment. In this paper, we use graph decompositions to construct mixed practice task sets for Calculus I, focusing on derivative computation tasks, or tasks of the form "Compute $f'(x)$ of the function $f(x)=$ [elementary function]." A decomposition $D$ of a graph $G=(V,E)$ is a collection $\{H_1, H_2, ... , H_t\}$ of nonempty subgraphs such that $H_i=G[E_i]$ for some nonempty subset $E_i$ of $E(G)$, and $\{E_1, E_2, ... , E_t\}$ is a partition of $E(G)$. We extend results on decompositions of the complete directed graph due to Meszka and Skupień to construct balanced task sets that assess the Chain Rule. |
| title | On the Existence of Balanced Chain Rule Task Sets |
| topic | Combinatorics 05B30, 97I40 |
| url | https://arxiv.org/abs/2501.13253 |