You need to enable JavaScript to run this app.
优惠活动
大模型
产品
解决方案
定价
更多

求证:整除c-a与c+a的正整数为1或2及相关GCD等式

Proof for the Number Theory Problem

Let's break this down clearly — first, we need to establish our context: we're working with primitive positive integer Pythagorean triples (i.e., (a, b, c) are positive integers satisfying (c^2 = a^2 + b^2) and (\text{GCD}(a, b, c) = 1)). For such triples, (c) is always odd, and exactly one of (a) or (b) is odd (since the sum of two odd squares would be congruent to 2 mod 4, which can't be a perfect square).


Part 1: Any positive integer dividing both (c-a) and (c+a) must be 1 or 2

Let (d) be a positive integer that divides both (c-a) and (c+a). By basic divisibility rules, (d) must divide any linear combination of these two numbers — specifically their sum and difference:

  • (d \mid (c+a) + (c-a) = 2c)
  • (d \mid (c+a) - (c-a) = 2a)

This means (d) divides (\text{GCD}(2a, 2c) = 2 \cdot \text{GCD}(a, c)). Now, since we're dealing with a primitive triple:

  • If (\text{GCD}(a, c) = g > 1), then (g) would divide (c^2 - a^2 = b^2), so (g \mid b) — which contradicts (\text{GCD}(a, b, c) = 1). Thus, (\text{GCD}(a, c) = 1).

So (\text{GCD}(2a, 2c) = 2), which means (d) can only be a positive divisor of 2. The only such divisors are 1 and 2.


Part 2: Prove (\text{GCD}\left(\frac{c-a}{2}, \frac{c+a}{2}\right) = 1)

First, since (c) and (a) are both odd (from the primitive triple property), (c-a) and (c+a) are both even — so (\frac{c-a}{2}) and (\frac{c+a}{2}) are integers.

Let (g = \text{GCD}\left(\frac{c-a}{2}, \frac{c+a}{2}\right)). Again, using divisibility rules for sums and differences:

  • (g \mid \frac{c+a}{2} + \frac{c-a}{2} = c)
  • (g \mid \frac{c+a}{2} - \frac{c-a}{2} = a)

This means (g) divides (\text{GCD}(a, c)), which we already proved is 1. Therefore, (g = 1).


内容的提问来源于stack exchange,提问作者Inverse Problem

相关产品推荐
方舟 Agent Plan

超全模态模型 × Harness 升级,最新支持 Deepseek-V4.1-Flash、GLM-5.3 系列、Doubao-Seedream-5.0-pro、Kimi-K3 (部分), 限时 9.9 元起

最近更新时间:2026.05.19 03:18:28