# Prove It

$$a,b,c,d$$ are integers such that $$ad+bc$$ divides each of $$a,b,c,d$$ then prove that $$ad+bc = \pm 1$$.

Note by Vilakshan Gupta
1 year, 3 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

First, observe that ad + bc cannot be 0. Now, let the gcd (a, b, c, d) = x. Then,

a = l * x, b = k * x, c = m * x, d = n * x and gcd (l, k, m, n) = 1.

ad + bc = x^2(l * n) + x^2(k * m) = x^2 (l * n + k * m)

ad + bc divides a, b, c, d, and so does x^2 (l * n + k * m). But we have set the gcd (a, b, c, d) to be x. Therefore,

x = x^2 (l * n + k * m), and because (l * n + k * m) is an integer and cannot be 0 (recall the first observation), x has to be 1 or -1.

x = ± 1

(l * n + k * m) = ± 1

ad + bc = ± 1

- 1 year, 2 months ago