Thread:

1. Simple congruence

Does $\frac{2^x-1}{3}=n$, n natural, have odd solutions in the naturals for x? How do you know (does Euler's theorem tell me this)?

2. Originally Posted by sleepingcat
Does $\frac{2^n-1}{3}$ have odd solutions in the naturals? How do you know?
All odd natural numbers (n) can be written $n=2k+1, k \in \mathbb{N} \cup 0$

For the above to have solutions in the odd naturals this must be true for some k

$(2^{n}-1 \equiv 0 \mod \\\ {3}) \iff (2^{2k+1}-1 \equiv 0 \mod \\\ {3}) \iff (2\cdot 4^{k}-1 \equiv 0 \mod \\\ {3})$

but $[4^k]=[4]^k=[1]^k$ mod 3

$(2\cdot 4^{k}-1 \equiv 0 \mod \\\ {3})\implies (2\cdot 1^{k}-1 \equiv 0 \mod \\\ {3}) \implies (2-1 \equiv 0 \mod \\\ {3})$

This false so there is not a solution.

3. Originally Posted by sleepingcat
Does $\frac{2^x-1}{3}=n$, n natural, have odd solutions in the naturals for x? How do you know (does Euler's theorem tell me this)?
Note that $2^x - 1 = 1+2+2^2+...+2^{x-1}$ (this identity appears in The Elements).

Next, $2 \equiv -1 (\bmod 3)$.
Thus, $1+2+2^2+...+2^{x-1} = \pm 1(\bmod 3)$ (depending whether $x$ is even or odd).
Thus, it is impossible to have this congruent to $0$ mod 3.
{"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": 12, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "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.8816298246383667, "perplexity_flag": "middle"}