{"id":"power-of-two-bit-trick","text":"`n & (n - 1) == 0` detects positive integers with exactly one set bit (powers of two); this is a foundational kernel reused in power-of-four and referenced by number-of-1-bits (Brian Kernighan's algorithm) across the repo.","truth_value":"IN","source":"entries/2026/06/06/power-of-two-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"power-of-two-bit-trick","truth_value":"IN","reason":"premise"}]}}