{"id":"repeated-n-times-pigeonhole-bound","text":"In a 2n-length array where one value repeats n times, the pigeonhole principle guarantees a duplicate is found within the first n+1 elements during a linear scan.","truth_value":"IN","source":"entries/2026/06/06/n-repeated-element-in-size-2n-array-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"repeated-n-times-pigeonhole-bound","truth_value":"IN","reason":"premise"}]}}