The room felt the movement before they saw it. Two heads turned in the second row. Sarah Bell elbowed Hannah. Hannah covered her mouth.
Caldwell, at the front of the room, was correcting a student's test in red ink. She looked up. Her face did not move at first. Then it moved a little. "Yes, Mr. Tate. What is it?"
"Ma'am, there's a typo on problem four."
The room went silent in a way that did not happen often in room 214.
Caldwell blinked. "Excuse me?"
"Problem four. Row two of the matrix is missing a minus sign. As printed, the determinant is zero. There's no inverse. I wanted to ask if I should solve it as is or assume the correction."
He said it the way a kid asks for the bathroom pass. Caldwell stared at him. Dean Holloway in the back looked at Caldwell.
She could not say "fix the typo" because the typo was not hers to fix; she had not written this exam. She had taken it out of a folder marked Princeton MathBridge Internal Use. She had not been authorized to remove it from a Princeton office four years ago. The typo was on the original.
She also could not say "there's no typo" because the typo was right there, and the boy at the back of the room could read it.
What she said finally was, "Solve it however you think is correct, Mr. Tate."
"Yes, ma'am."
He set his pencil down and went back to work.
Caldwell turned slowly to face the chalkboard. She wrote nothing. She just stood there for 10 seconds with the chalk in her hand. Then she put the chalk down. Then she walked back to her desk and sat. It was the first time anyone in the class had seen her sit during an exam.
In the second row, Sarah Bell looked at Hannah Reed. Hannah was already looking back. Neither of them said anything; they didn't need to. A boy across the aisle leaned forward and tried to read the page on Wesley's desk. A girl behind him pulled his sleeve and shook her head: Don't. The boy let go and sat back, but he kept watching.
Wesley returned to problem seven: number theory. Find the smallest positive integer $n$ such that $n^2 + 1$ is divisible by 5. It was a problem he could not brute-force in his head, because the problem was not really about answers; it was about seeing structure. Looking at $n$ by itself would not work—he had been doing that.
He thought of his father's line again: Change what you're looking at.
Wesley wrote: Let $n = 5k + r$, where $r$ is the remainder when $n$ is divided by 5. He worked through the five possibilities: $r = 0, 1, 2, 3, 4$. He squared each one, added one, and checked which gave a multiple of 5. Two values of $r$ worked. The smallest one gave him $n = 2$. He wrote $n = 2$ in the answer box. He checked it: $2^2 + 1 = 5$. Yes. Four minutes had passed. He had problem seven done.
The pencil felt warm in his hand. He turned to problem eight. This was a question about vectors in three-dimensional space: find the plane through three given points. Standard—the kind of question a strong calc student could do in his sleep. He cross-producted two difference vectors, dotted with a third, and wrote the equation. Two minutes. Problem eight done. 43 minutes left.
He turned to problem nine. This one was different. The header said: Abstract Algebra: Elementary Group Theory. Below it: Determine whether the set of all $2 \times 2$ invertible matrices with integer entries forms a group under matrix multiplication. If yes, prove. If no, find the smallest counterexample.
Wesley did not learn group theory in school. Lincoln High did not teach it; Calculus BC did not require it; most college freshmen did not see it until their second semester. But Wesley's father had written about it in the notebook—two pages in pencil, dated 1996. Wesley remembered the words even though the notebook was zipped in his backpack and he could not look at it: A group needs four things, son: closure, identity, inverse, associativity. If any one of those is missing, it's not a group.
He had to slow down. This was not a calculus problem he could attack on instinct; this was a problem that asked him to take a definition apart and check it against every face. He breathed in, breathed out, and wrote.
He started with closure. Did multiplying two such matrices stay in the set? Yes: both had integer entries, the product had integer entries; both had non-zero determinants, the product had a non-zero determinant. Closure held.
Identity: the $2 \times 2$ identity matrix had integer entries and was invertible. Yes.
Then he hit it: inverse. A matrix with integer entries had an inverse with integer entries only when its determinant equaled $\pm 1$. If the determinant was 3, the inverse had fractions. Wesley smiled, very small. The set did not form a group. The cleanest counterexample was a diagonal matrix with 2s on the diagonal: determinant 4, inverse was a diagonal matrix with halves—not integer entries, not in the set.
He wrote a clean two-paragraph answer. 11 minutes.
In the second row, Hannah whispered almost without moving her mouth: "Sarah, I know he's done nine."
"I know, Hannah."
When he looked up, the clock said 43 minus 11, which meant only 32 minutes were left. His shirt was damp at the back of his neck. The clock above the chalkboard had started to sound louder. Each tick was small and clean, like a finger tapping a glass. Wesley could hear his own breathing in his ears. He could hear the chalkboard rail rattle once when Caldwell shifted in her seat. He could hear the radiator down the hall click on, then off, then on.
Caldwell, still at her desk, had not stood up the whole time. She kept opening her grade book, looking at it, closing it, opening it again. Her hand was tight around her pen. At one point, she stood up and walked to the window. She looked out at the parking lot, looked at the clock, walked back, and sat down. Dean Holloway, from the back of the room, did not move at all anymore.
Wesley turned to problem 10. It was an integration problem with a substitution that was not obvious—calculus dressed in disguise. He could see the move within a few seconds; he just had to execute it cleanly. Three minutes. Problem 10 done.
He had two left. He had 20 minutes. The worst question was still ahead.
Wesley turned to problem 11. It was the longest one on the test: half a page of dense print. The header said: Modular Arithmetic Application Problem. The body asked him to determine the structure of a set under a non-standard operation and prove it.
He started reading the first paragraph, and then he saw it. At the very bottom of the page was a single line in italic typeface. The print was small; he had probably skipped it the first time he flipped through: