PUZZLE #4232: Handshake Lemma (diff 2)

handshake-lemma learn difficulty: 2/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 [6, 4, 3, 3, 2], compute the total number of handshakes (edges). The answer is the letter at position (edges mod 26).

DATA

Degree Sequence	`6, 4, 3, 3, 2`
Vertex Count	`5`
Hint	`Sum of degrees = 18. Divide by 2 to get edges = 9. Edges mod 26 = 9 → 'j'.`
Answer Format	`single lowercase letter`

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

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