Chapter 2: Rhythm
1.1: Basics
Finding the tactus, the measure, and their subdivisions
The most common grouping of the tactus is four beats per measure. Subdivisions of the tactus are normally two, three, or four tatums.
Compare Sister Rosetta Tharpe’s “That’s All” with Otis Redding’s “Respect” (made popular by Aretha Franklin). Both have four-beat measures. In “That’s All,” beats are subdivided into three tatums, while in “Respect,” they are divided into four tatums (i.e. subdivided into two twice).
1.2 Rhythm patterns
Simple clapping or drumming rhythms may be represented by drum tab, with x for a clap and - for a rest. Both symbols take one beat (that is, one pulse in the tactus).
Measures are indicated by bars, like so:
|xx--|xx--|xx--|
This means that there is a four-beat measure, and you repeat the pattern clap-clap-rest-rest three times. You could also write this pattern as |xx--| ×3.
The downbeat is the first beat in the measure. It’s usually clapped louder than the other beats.
The formula for the number of binary codes
The length of a binary code is the number of symbols in that particular code. For example, x--x-x- has length 7. How many binary codes of a given length are possible? Here’s a chart, using the symbols 0 and 1:
Length | Codes | Number of codes |
1 | 0, 1 | 2 = 21 |
2 | 00, 01, 10, 11 | 4 = 22 |
3 | 000, 001, 010, 011, 100, 101, 110, 111 | 8 = 23 |
4 | 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111, �1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111 | 16 = 24 |
Formula: There are 2n codes that have length n.
Two algorithms for writing binary codes
Algorithm 1. To write the codes of length n+1, write the codes of length n twice, then add 0’s to the beginning of the first group of codes and 1’s to the second group of codes.
Example: writing the codes of length 3
Algorithm 2. Use the 2n formula to find the number of codes you need. Build a list of the codes by repeating 0, 1, 0, 1 in the right column, 0, 0, 1, 1, 0, 0, 1, 1, in the next column, 4 0’s, 4 1’s in the next column, 8 0’s, 8 1’s, and so on until all columns are complete.�Example: writing the codes of length 3
Step 1 | Step 2 | Step 3 |
Codes of length 2: 00 01 10 11 | 00 01 10 11 00 01 10 11 | 000 001 010 011 100 101 110 111 |
Step 1 | Step 2 | Step 3 | Step 4 |
There are 23=8 codes | 0 1 0 1 0 1 0 1 | 00 01 10 11 00 01 10 11 | 000 001 010 011 100 101 110 111 |
Example: Drum patterns and binary codes
Every drum pattern may be written as a binary code using the symbols x (strike) and - (rest). Each x or - takes the same amount of time, which I’ll call a “beat.” An example of an 8-beat pattern is x-x-x---.
Question: How many 8-beat drum patterns are there?
Answer: there are 28 = 256 drum patterns with 8 beats.
Question: List the drum patterns with 4 beats.
Answer: There are 24 = 16 total patterns. Use Algorithm #2 on the previous slide to list them, using x instead of 0 and - instead of 1.
xxxx -xxx�xxx- -xx-�xx-x -x-x�xx-- -x--�x-xx --xx�x-x- --x-�x--x ---x�x--- ----�
The “John Cage” rhythm!
Thinking about music like a mathematician
Suppose you want to fill the space of 4 beats with some combination of
For example, 112 represents two 1-beat notes followed by a 2-beat note, for a total of 4 beats. You could also write the pattern as 𝅘𝅥 𝅘𝅥 𝅗𝅥
Question: How many different ways can you fill 4 beats? � Answer: five ways. They are 1111, 112, 121, 211, 22.� In music notation, that’s 𝅘𝅥 𝅘𝅥 𝅘𝅥 𝅘𝅥 𝅘𝅥 𝅘𝅥 𝅗𝅥 𝅘𝅥 𝅗𝅥 𝅘𝅥 𝅗𝅥 𝅘𝅥 𝅘𝅥 𝅗𝅥 𝅗𝅥�
Clapping Music
Here is the basic pattern for Steve Reich’s �“Clapping Music” (1972): xxx-xx-x-xx-�The first player repeats this 12-beat pattern until the end of the piece. The second player claps 12 different patterns, clapping each pattern 12 times.
xxx-xx-x-xx- -x-xx-xxx-xx�xx-xx-x-xx-x x-xx-xxx-xx-�x-xx-x-xx-xx -xx-xxx-xx-x�-xx-x-xx-xxx xx-xxx-xx-x-�xx-x-xx-xxx- x-xxx-xx-x-x�x-x-xx-xxx-x -xxx-xx-x-xx� xxx-xx-x-xx-��
Player 2 claps the original pattern 4 more times at the end.
The resultant rhythm
The resultant rhythm is the pattern of claps (or strikes) and rests that are heard when two people clap or play together. For example:
Player 1 x--x--x-�Player 2 -xxx---x�Resultant xxxx--xx
The resultant has an x whenever either or both of the players clap and a rest if they both rest. Of course, the music is slightly louder when both players clap.
Notice that the resultant rhythm changes every time the second player claps a different pattern.
A mathematical response to Clapping Music
As a mathematician, I asked several questions about this pattern
212 - 1 (not allowing ------------)
Yes. For example, xxxxxxxxxxxx, x-x-x-x-x-x-, and x---x---x--- are bad because the composition ends too early. In general, any pattern with repeats is bad for this reason.
If variation in the resultant rhythm is “good,” a “good” pattern would have approximately the same number of hits and rests.
Baby Clapping Music
As a class, we recreated “Clapping Music” using four-beat patterns. We tried x-x- and xxx-. The second composition doesn’t end until the second person has clapped four different patterns, while the first pattern has only two different variations, x-x- and -x-x, so the composition is very short.
As groups, I’d like you to decide on a 6-beat rhythm pattern. Write down the six-beat patterns formed by the same process as the patterns clapped by the second person in “Clapping Music.” Then, choose a “band name” and write your pattern on the board with your group name. Write all the variations that are clapped by the second player. For extra credit, perform the composition.
Are some groups’ patterns the same? Similar? Which ones seem to be “better” or at least most like Reich’s Clapping Music?
Circular notation
If a pattern is repeated, it makes sense to write it on a circle, with each blob representing a clap. Here are the first four patterns in Clapping Music:
Write your group’s drum pattern on a circle and put it on the board. Perform your pattern and discuss the types of resultant rhythms you hear.
Conclusions
EXERCISE. A pattern is reducible if it is made of repeated shorter patterns and primitive otherwise (this is what I called “good”). For example, x--x-- and xxxxx are reducible and x-xxx- is not. Find the number of reducible and primitive patterns of up to 7 beats. Include the empty rhythm in your count of reducible rhythms.
Beats | Total=2n | Reducible | Primitive | Primitive ÷�num. of beats |
1 | 2 | 0 | 2 | 2/1=2 |
2 | 4 | | | |
3 | 8 | | | |
4 | 16 | | | |
5 | 32 | | | |
6 | 64 | 10 | 54 | 54/6=9 |
7 | 128 | | | |
We’ll use the Online Encyclopedia of Integer Sequences to investigate our data.
How many 12-beat reducible patterns are there?
EXERCISE. A pattern is reducible if it is made of repeated shorter patterns and primitive otherwise (this is what I called “good”). For example, x--x-- and xxxxx are reducible and x-xxx- is not. Find the number of reducible and primitive patterns of up to 7 beats. Include the empty rhythm in your count of reducible rhythms.
Beats | Total | Reducible | Primitive | Primitive ÷�num. of beats |
1 | 2 | 0 | 2 | 2/1 = 2 |
2 | 4 | 2 | 2 | 2/2 = 1 |
3 | 8 | 2 | 6 | 6/3 = 1 |
4 | 16 | 4 | 12 | 12/4 = 3 |
5 | 32 | 2 | 30 | 30/5 = 6 |
6 | 64 | 10 | 54 | 54/6 = 9 |
7 | 128 | 2 | 126 | 126/7 = 18 |
Use the Online Encyclopedia of Integer Sequences to investigate the sequence�
2, 2, 6, 12, 30, 54, 126 ...
How many 12-beat primitive patterns are there?
What do mathematicians call this type of pattern?
4020
A binary sequence with primitive period n
Equivalent patterns
We’ll say that two patterns are equivalent if one is a variation of the other that is produced by repeatedly shifting the first beat of the other to the end (that is, “Clapping Music style”). For example, xx-xxx and x-xxxx are equivalent.
Classes of equivalent patterns
There are 14 “classes” (collections) of equivalent patterns with 6 beats.
1.3 Duration
Western musical notation specifies how long a note or rest lasts. In a four-beat measure, a whole note occupies four beats, etc.
Whole note
Half notes
Quarter notes
Eighth notes
Sixteenth notes
Fibonacci numbers
The Fibonacci numbers (called Hemacandra numbers in India) are
1, 2, 3, 5, 8, 13, 21, 34, 55, …
where each number is the sum of the two previous numbers. The number of ways to fill any given number of beats with notes of length 1 and 2 is a Fibonacci number. Precisely, there are�1 way to fill a duration of 1 beat�2 ways to fill a duration of 2 beats�3 ways to fill a duration of 3 beats�5 ways to fill a duration of 4 beats�8 ways to fill a duration of 5 beats, and so on…..�This fact was discovered by the Indian scholar Hemacandra c.1150 AD.
The domino-square tiling problem
Theorem: Suppose n is a counting number. The number of ways you can tile a nx1 rectangle with 2x1 dominoes and 1x1 squares is a Fibonacci number for every value of n.
This picture suggests why...