{"id":"smallest-multiple-parity-shortcut","text":"The LCM of `n` and 2 is computed as a parity check (`n if n % 2 == 0 else n * 2`) rather than using `math.gcd`, because 2 is prime so `gcd(n, 2)` is always 1 or 2","truth_value":"IN","source":"entries/2026/06/06/smallest-even-multiple-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"smallest-multiple-parity-shortcut","truth_value":"IN","reason":"premise"}]}}