{"id":"gcd-of-extremes-not-pairwise","text":"`findGCD` computes `gcd(min(nums), max(nums))` — the GCD of only the smallest and largest elements, not a pairwise reduction across all elements.","truth_value":"IN","source":"entries/2026/06/06/find-greatest-common-divisor-of-array-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"gcd-of-extremes-not-pairwise","truth_value":"IN","reason":"premise"}]}}