@article {MATHEDUC.06618962,
author = {Ludwick, Kurt},
title = {Counting melodies: recursion through music for a liberal arts audience.},
year = {2016},
journal = {PRIMUS. Problems, Resources, and Issues in Mathematics Undergraduate Studies},
volume = {26},
number = {4},
issn = {1051-1970},
pages = {325-333},
publisher = {Taylor \& Francis, Philadelphia, PA},
doi = {10.1080/10511970.2015.1122689},
abstract = {Summary: In the study of music from a mathematical perspective, several types of counting problems naturally arise. For example, how many different rhythms of a specified length (in beats) can be written if we restrict ourselves to only quarter notes (one beat) and half notes (two beats)? What if we allow whole notes, dotted half notes, etc.? Or, what if we allow each note to be selected from some specified set of tones (e.g., C, C$\sharp$, D, etc.)? In my course on music and mathematics for the liberal arts, I use these questions as a method of introducing students to the concept of recursion, as it turns out that such questions lead naturally to sequences (indexed based on the length of the rhythms or melodies being considered) defined by recurrence relations, such as the Fibonacci sequence.},
msc2010 = {M85xx (K25xx N75xx)},
identifier = {2016e.00964},
}