# Primes of the form $a^k + b^k$

How many primes are there of the form $a^{k/2} + b^{k/2}$ exist for $a$ and $b$ (positive integer solutions).

I am hoping there is only one.

EDIT $k > 1$

-
If $k$ is odd and greater than $1$, there is none since $a+b$ divides $a^k + b^k$. And every prime of the form $4m+1$ can be expressed as a sum of two squares. – user17762 Sep 27 '12 at 21:28
and if k is even? – fosho Sep 27 '12 at 21:28
If $a=2$ and $b=1$ there are known to be multiple solutions, the so-called Fermat primes. If $a=2$ and $b=3$ then $k=1$, $k=2$ and $k=4$ all give solutions. – Steven Stadnicki Sep 27 '12 at 21:30
see edit please – fosho Sep 27 '12 at 21:31

1
@fosho Is your question "Given $a$ and $b$, how many primes are of the form $a^k + b^k$?" or "Given $k$, how many primes are of the form $a^k + b^k$?" or is it just "How many primes are of the form $a^k + b^k$"? – user17762 Sep 27 '12 at 21:34
show 7 more comments

## 1 Answer

Infinitely many. In fact, every prime $p \equiv 1 \pmod 4$ can be written as the sum of two squares; a result attributed to Fermat. And there are infinitely many such primes, according to Dirichlet's Theorem.

-
{"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": 24, "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.3, "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.9353016018867493, "perplexity_flag": "middle"}