# Thread:

1. ## Composite number proof help

Hello, I am having trouble with following proof:

Prove that all integers

2^2^(2n+1) +3 2^2^(4n+1) +7 , n = 1, 2, 3 ...

are composite.

Any help is appreciated , Thanks - Kate

2. Originally Posted by katie07
Hello, I am having trouble with following proof:

Prove that all integers

2^2^(2n+1) +3 2^2^(4n+1) +7 , n = 1, 2, 3 ...

are composite.

Any help is appreciated , Thanks - Kate
I don't have time to do this in more detail, but my impression is that this might be doable by an induction proof.

-Dan

Edit: If it's going to be done by induction, it will take a better Mathematician than me!

3. this is supposed to be $2^{2^{2n + 1}} + 3 \cdot 2^{2^{4n + 1}} + 7$ right?

i'm having trouble proving this is composite for n = 1, but i'm not that good with divisibility on such a large scale, the number is huge.
{"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": 1, "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.9370684027671814, "perplexity_flag": "middle"}