{"id":"divisible-pairs-loop-guarantees-uniqueness","text":"The inner loop `j in range(i + 1, n)` ensures each unordered pair `(i, j)` is visited exactly once with `i < j` always satisfied, preventing duplicates by construction.","truth_value":"IN","source":"entries/2026/06/06/count-equal-and-divisible-pairs-in-an-array-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"divisible-pairs-loop-guarantees-uniqueness","truth_value":"IN","reason":"premise"}]}}