{"id":"inclusive-range-contract","text":"`countPrimeSetBits(left, right)` treats both `left` and `right` as inclusive bounds, using `range(left, right + 1)` to match the LeetCode problem specification","truth_value":"IN","source":"entries/2026/06/06/prime-number-of-set-bits-in-binary-representation-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"inclusive-range-contract","truth_value":"IN","reason":"premise"}]}}