# division by integers

let d,k be integers, with k even.

suppose d|2k

suppose d does not divide 2

suppose d does not divide k

show that d equals 2k.

(I'm really just trying to understand the 2nd last line, in this answer to the question: Prove that if $p$ is an odd prime that divides a number of the form $n^4 + 1$ then $p \equiv 1 \pmod{8}$)

-

## 1 Answer

It's not true. Take $k=6$ and $d = 4$ for example.

-

You're right. I see now.   Could you possibly explain to me how the author of the reference concludes that d = 2k in the link I provided? I'd greatly appreciate that. – confused Aug 18 '12 at 7:43
@confused I don't know what the purpose of that answer was. It looks like he wanted to generalize the question to other powers of $k$, but this generalization isn't correct (with $k = 6$, $5$ is an odd divisor of $2^6 + 1$ and is not $\equiv 1 \bmod 2*6$.) – Cocopuffs Aug 18 '12 at 8:00
{"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": 10, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "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": 20, "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.9671386480331421, "perplexity_flag": "head"}