# Number Theory

Printable View

• July 9th 2008, 02:41 PM
JCIR
Number Theory
Let $a,b \in \mathbb{Z} .$ with (a,4)=2 and (b,4)=2. find (a+b, 4) and prove that your answer is correct.
• July 9th 2008, 04:20 PM
Reckoner
Quote:

Originally Posted by JCIR
Let $a,b \in \mathbb{Z} .$ with (a,4)=2 and (b,4)=2. find (a+b, 4) and prove that your answer is correct.

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

$\emph{Proof: }$ First, note that the only possible divisors of 4 are 1, 2, and 4, so we only need show that $4\mid(a + b)$

$(a,\,4) = 2\text{ and }(b,\,4)=2\Rightarrow2\mid a\text{ and }2\mid b\Rightarrow\exists p,\,q\in\mathbb{Z},\;a = 2p,\,b = 2q$

$\Rightarrow a + b = 2(p + q)$

But $2\nmid p$, for if so, $\exists m\in\mathbb{Z},\;a = 2(2m) = 4m\Rightarrow4\mid a$ and so $(a,\,4) = 4$ and not 2 as required. Similarly, $2\nmid q$.

Thus $p$ and $q$ are odd so their sum $p + q$ must be even (i.e., $\exists s,\,t\in\mathbb{Z},\;p = 2s + 1\text{ and }q = 2t + 1$ $\Rightarrow p + q = 2s + 2t + 2 = 2(s + t + 1)$ with $s + t + 1\in\mathbb{Z}$). So $4\mid2(p + q)\Rightarrow4\mid(a + b)$ as required to show that $(a + b,\,4) = 4\quad\square$
All times are GMT -8. The time now is 11:22 AM.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 19, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9394466280937195, "perplexity_flag": "middle"}