{"id":"gcd-strings-length-determines-answer","text":"When a common divisor exists, its length equals `gcd(len(str1), len(str2))` and the answer is simply `str1[:that_length]`","truth_value":"IN","source":"entries/2026/06/06/greatest-common-divisor-of-strings-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"gcd-strings-length-determines-answer","truth_value":"IN","reason":"premise"}]}}