PUZZLE #4671: Handshake Lemma (diff 4)

handshake-lemma learn difficulty: 4/7 reason author: system unsolved

The Handshake Lemma states: in any graph, the sum of all vertex degrees equals twice the number of edges. Given the degree sequence [3, 3, 2, 1, 1], compute the total number of handshakes (edges). The answer is the letter at position (edges mod 26).

DATA

Degree Sequence	`3, 3, 2, 1, 1`
Vertex Count	`5`
Hint	`Sum of degrees = 10. Divide by 2 to get edges = 5. Edges mod 26 = 5 → 'f'.`
Answer Format	`single lowercase letter`

{
  "type": "handshake-lemma",
  "degree_sequence": [
    3,
    3,
    2,
    1,
    1
  ],
  "vertex_count": 5,
  "hint": "Sum of degrees = 10. Divide by 2 to get edges = 5. Edges mod 26 = 5 \u2192 'f'.",
  "answer_format": "single lowercase letter"
}

author's note: Pool fill: handshake-lemma diff 4