Proving $(a+b,\ a^2-ab+b^2)=1$ or $3$

  • MHB
  • Thread starter alexmahone
  • Start date
In summary: And so $d=1$ or $d=3$ by the definition of divisibility. This completes the proof.In summary, if $(a, b) = 1$, then $(a+b, a^2-ab+b^2)=1$ or $3$, as shown by considering the common divisors of $a+b$ and $a^2-ab+b^2$.
  • #1
alexmahone
304
0
Show that if $(a, b)=1$ then $(a+b,\ a^2-ab+b^2)=1\text{ or }3$.

My attempt:

$(a+b,\ a^2-ab+b^2)=(a+b,\ a^2-ab+b^2-(a+b)(a+b))=(a+b,\ -3ab)=(a+b,\ 3ab)$

$(a,\ a+b)=(b,\ a+b)=1$

$\therefore (a+b,\ ab)=1$

Consider 2 cases:

1) $(a+b,\ 3)=1 \implies(a+b,\ 3ab)=1$

2) $(a+b,\ 3)=3\implies 3|a+b$

$\displaystyle (a+b,\ ab)=1\implies\left(\frac{a+b}{3},\ ab\right)=1$

$\displaystyle (a+b,\ 3ab)=3\left(\frac{a+b}{3},\ ab\right)=3$

Is that ok?
 
Last edited:
Mathematics news on Phys.org
  • #2
Alexmahone said:
Show that if $(a, b)=1$ then $(a+b,\ a^2-ab+b^2)=1\text{ or }3$.

My attempt:

$(a+b,\ a^2-ab+b^2)=(a+b,\ a^2-ab+b^2-(a+b)(a+b))=(a+b,\ -3ab)=(a+b,\ 3ab)$

$(a,\ a+b)=(b,\ a+b)=1$

$\therefore (a+b,\ ab)=1$

Consider 2 cases:

1) $(a+b,\ 3)=1 \implies(a+b,\ 3ab)=1$

2) $(a+b,\ 3)=3\implies 3|a+b$

$\displaystyle (a+b,\ ab)=1\implies\left(\frac{a+b}{3},\ ab\right)=1$

$\displaystyle (a+b,\ 3ab)=3\left(\frac{a+b}{3},\ ab\right)=3$

Is that ok?
Yes. Perfect.
 
  • #3
You might be interested in the following approach:

Let $d$ be a common divisor of $a+b$ and $a^2-ab+b^2$. Then $ d|(a+b)$ and this can be rewritten as $ a \equiv - b (\bmod. d)$

And so $0\equiv a^2-ab+b^2 \equiv (-b)^2 - (-b) \cdot b + b^2 = 3 b^2 (\bmod. d)$ . But we must have $(d,b) = 1$ since $(a,b)=1$ and $d | (a+b)$ (because any common divisor of $b$ and $d$ will also divide $a$).

Thus $0 \equiv 3 (\bmod. d)$ ...
 

FAQ: Proving $(a+b,\ a^2-ab+b^2)=1$ or $3$

How do you prove $(a+b,\ a^2-ab+b^2)=1$ or $3$?

To prove $(a+b,\ a^2-ab+b^2)=1$ or $3$, you can use mathematical induction. First, you can prove the base case by substituting in values for $a$ and $b$. Then, you can assume the statement is true for $n=k$ and use that to prove it is also true for $n=k+1$. This will show that the statement holds for all positive integers.

Why is it important to prove $(a+b,\ a^2-ab+b^2)=1$ or $3$?

Proving $(a+b,\ a^2-ab+b^2)=1$ or $3$ is important because it shows that the expression is always divisible by $1$ or $3$, regardless of the values of $a$ and $b$. This type of proof is often used in number theory and can have applications in cryptography and other areas of science and technology.

Can you provide an example of $(a+b,\ a^2-ab+b^2)=1$ or $3$?

Yes, for example, let $a=5$ and $b=7$. Then, $(a+b,\ a^2-ab+b^2)=(5+7,\ 5^2-5\cdot7+7^2)=(12,\ 25-35+49)=(12,\ 39)$. Since $12$ and $39$ have a greatest common divisor of $3$, the statement is true.

Are there any other methods to prove $(a+b,\ a^2-ab+b^2)=1$ or $3$?

Yes, there are other methods to prove this statement, such as using the Euclidean algorithm or using properties of modular arithmetic. However, mathematical induction is a common and straightforward method for proving this type of statement.

What are some potential applications of proving $(a+b,\ a^2-ab+b^2)=1$ or $3$?

Proving $(a+b,\ a^2-ab+b^2)=1$ or $3$ can have various applications in number theory, cryptography, and computer science. For example, it can be used in determining prime numbers or in creating secure encryption algorithms. It can also have implications in other branches of science, such as physics and chemistry, where mathematical proofs are often used to support theories and hypotheses.

Back
Top