When is $n^{2015}+n+1$ prime?












14












$begingroup$


$n in mathbb{N}$.



I think this seems true only for $1$.



I tried to show that $4n-1,2n+1,2^{n+1}-1$ divides the given expression but didn't succeed. I have only thought about this through the way of modular arithmetic. Someone suggested to me to use the complex roots of this equation, but didn't specify how. Are there any other results I can use for this problem(I may not know them)?



Please provide only hints if you do solve it. Thank you.






number-theory elementary-number-theory polynomials prime-numbers divisibility







share|cite|improve this question











$endgroup$












  • $begingroup$
    your term can be factorized!
    $endgroup$
    – Dr. Sonnhard Graubner
    Aug 10 '17 at 19:16
















14












$begingroup$


$n in mathbb{N}$.



I think this seems true only for $1$.



I tried to show that $4n-1,2n+1,2^{n+1}-1$ divides the given expression but didn't succeed. I have only thought about this through the way of modular arithmetic. Someone suggested to me to use the complex roots of this equation, but didn't specify how. Are there any other results I can use for this problem(I may not know them)?



Please provide only hints if you do solve it. Thank you.






number-theory elementary-number-theory polynomials prime-numbers divisibility







share|cite|improve this question











$endgroup$












  • $begingroup$
    your term can be factorized!
    $endgroup$
    – Dr. Sonnhard Graubner
    Aug 10 '17 at 19:16














14












14








14


5



$begingroup$


$n in mathbb{N}$.



I think this seems true only for $1$.



I tried to show that $4n-1,2n+1,2^{n+1}-1$ divides the given expression but didn't succeed. I have only thought about this through the way of modular arithmetic. Someone suggested to me to use the complex roots of this equation, but didn't specify how. Are there any other results I can use for this problem(I may not know them)?



Please provide only hints if you do solve it. Thank you.






number-theory elementary-number-theory polynomials prime-numbers divisibility







share|cite|improve this question











$endgroup$




$n in mathbb{N}$.



I think this seems true only for $1$.



I tried to show that $4n-1,2n+1,2^{n+1}-1$ divides the given expression but didn't succeed. I have only thought about this through the way of modular arithmetic. Someone suggested to me to use the complex roots of this equation, but didn't specify how. Are there any other results I can use for this problem(I may not know them)?



Please provide only hints if you do solve it. Thank you.






number-theory elementary-number-theory polynomials prime-numbers divisibility




number-theory elementary-number-theory polynomials prime-numbers divisibility






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 4 at 21:58









greedoid

41k1149101




41k1149101










asked Aug 10 '17 at 15:14









AdienlAdienl

551417




551417












  • $begingroup$
    your term can be factorized!
    $endgroup$
    – Dr. Sonnhard Graubner
    Aug 10 '17 at 19:16


















  • $begingroup$
    your term can be factorized!
    $endgroup$
    – Dr. Sonnhard Graubner
    Aug 10 '17 at 19:16
















$begingroup$
your term can be factorized!
$endgroup$
– Dr. Sonnhard Graubner
Aug 10 '17 at 19:16




$begingroup$
your term can be factorized!
$endgroup$
– Dr. Sonnhard Graubner
Aug 10 '17 at 19:16










2 Answers
2






active

oldest

votes


















27












$begingroup$

begin{eqnarray*}
n^{2015} +n+1 &=& n^{2015} -n^2+n^2+n+1 \
&=& n^2(n^{2013} -1) + n^2+n+1 \
&=& n^2(n^3-1)underbrace{(n^{2010}+n^{2007}+...+n^3+1)}_a +n^2+n+1 \
&=& (n^2+n+1)(an^2(n-1)+1) \
&=&
end{eqnarray*}
Since $n^2+n+1geq 3$ this could be prime only if $an^2(n-1)+1 =1$ and this is only when $n=1$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    This would be a good contest-math Q at some level of competition.
    $endgroup$
    – DanielWainfleet
    Jan 5 at 1:05



















11












$begingroup$

$2015equiv 2pmod{3}$ implies that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$, so...






share|cite|improve this answer









$endgroup$













  • $begingroup$
    What is that function?
    $endgroup$
    – Adienl
    Aug 10 '17 at 15:54






  • 1




    $begingroup$
    @Adienl: the standard notation for cyclotomic polynomials: en.wikipedia.org/wiki/Cyclotomic_polynomial
    $endgroup$
    – Jack D'Aurizio
    Aug 10 '17 at 15:57










  • $begingroup$
    Hi. I do not understand. Why does $2015equiv 2pmod{3}$ imply that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$?!
    $endgroup$
    – stressed out
    Jul 13 '18 at 8:02






  • 1




    $begingroup$
    Because n raised to the 2015th power is congruent to n^2 mod n^3-1, hence n^2015 is congruent to n^2 mod n^2+n+1 too, since the last polynomial is a divisor of n^3-1.
    $endgroup$
    – Jack D'Aurizio
    Jul 13 '18 at 9:07











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2389232%2fwhen-is-n2015n1-prime%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









27












$begingroup$

begin{eqnarray*}
n^{2015} +n+1 &=& n^{2015} -n^2+n^2+n+1 \
&=& n^2(n^{2013} -1) + n^2+n+1 \
&=& n^2(n^3-1)underbrace{(n^{2010}+n^{2007}+...+n^3+1)}_a +n^2+n+1 \
&=& (n^2+n+1)(an^2(n-1)+1) \
&=&
end{eqnarray*}
Since $n^2+n+1geq 3$ this could be prime only if $an^2(n-1)+1 =1$ and this is only when $n=1$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    This would be a good contest-math Q at some level of competition.
    $endgroup$
    – DanielWainfleet
    Jan 5 at 1:05
















27












$begingroup$

begin{eqnarray*}
n^{2015} +n+1 &=& n^{2015} -n^2+n^2+n+1 \
&=& n^2(n^{2013} -1) + n^2+n+1 \
&=& n^2(n^3-1)underbrace{(n^{2010}+n^{2007}+...+n^3+1)}_a +n^2+n+1 \
&=& (n^2+n+1)(an^2(n-1)+1) \
&=&
end{eqnarray*}
Since $n^2+n+1geq 3$ this could be prime only if $an^2(n-1)+1 =1$ and this is only when $n=1$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    This would be a good contest-math Q at some level of competition.
    $endgroup$
    – DanielWainfleet
    Jan 5 at 1:05














27












27








27





$begingroup$

begin{eqnarray*}
n^{2015} +n+1 &=& n^{2015} -n^2+n^2+n+1 \
&=& n^2(n^{2013} -1) + n^2+n+1 \
&=& n^2(n^3-1)underbrace{(n^{2010}+n^{2007}+...+n^3+1)}_a +n^2+n+1 \
&=& (n^2+n+1)(an^2(n-1)+1) \
&=&
end{eqnarray*}
Since $n^2+n+1geq 3$ this could be prime only if $an^2(n-1)+1 =1$ and this is only when $n=1$.






share|cite|improve this answer









$endgroup$



begin{eqnarray*}
n^{2015} +n+1 &=& n^{2015} -n^2+n^2+n+1 \
&=& n^2(n^{2013} -1) + n^2+n+1 \
&=& n^2(n^3-1)underbrace{(n^{2010}+n^{2007}+...+n^3+1)}_a +n^2+n+1 \
&=& (n^2+n+1)(an^2(n-1)+1) \
&=&
end{eqnarray*}
Since $n^2+n+1geq 3$ this could be prime only if $an^2(n-1)+1 =1$ and this is only when $n=1$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Aug 10 '17 at 15:40









greedoidgreedoid

41k1149101




41k1149101












  • $begingroup$
    This would be a good contest-math Q at some level of competition.
    $endgroup$
    – DanielWainfleet
    Jan 5 at 1:05


















  • $begingroup$
    This would be a good contest-math Q at some level of competition.
    $endgroup$
    – DanielWainfleet
    Jan 5 at 1:05
















$begingroup$
This would be a good contest-math Q at some level of competition.
$endgroup$
– DanielWainfleet
Jan 5 at 1:05




$begingroup$
This would be a good contest-math Q at some level of competition.
$endgroup$
– DanielWainfleet
Jan 5 at 1:05











11












$begingroup$

$2015equiv 2pmod{3}$ implies that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$, so...






share|cite|improve this answer









$endgroup$













  • $begingroup$
    What is that function?
    $endgroup$
    – Adienl
    Aug 10 '17 at 15:54






  • 1




    $begingroup$
    @Adienl: the standard notation for cyclotomic polynomials: en.wikipedia.org/wiki/Cyclotomic_polynomial
    $endgroup$
    – Jack D'Aurizio
    Aug 10 '17 at 15:57










  • $begingroup$
    Hi. I do not understand. Why does $2015equiv 2pmod{3}$ imply that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$?!
    $endgroup$
    – stressed out
    Jul 13 '18 at 8:02






  • 1




    $begingroup$
    Because n raised to the 2015th power is congruent to n^2 mod n^3-1, hence n^2015 is congruent to n^2 mod n^2+n+1 too, since the last polynomial is a divisor of n^3-1.
    $endgroup$
    – Jack D'Aurizio
    Jul 13 '18 at 9:07
















11












$begingroup$

$2015equiv 2pmod{3}$ implies that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$, so...






share|cite|improve this answer









$endgroup$













  • $begingroup$
    What is that function?
    $endgroup$
    – Adienl
    Aug 10 '17 at 15:54






  • 1




    $begingroup$
    @Adienl: the standard notation for cyclotomic polynomials: en.wikipedia.org/wiki/Cyclotomic_polynomial
    $endgroup$
    – Jack D'Aurizio
    Aug 10 '17 at 15:57










  • $begingroup$
    Hi. I do not understand. Why does $2015equiv 2pmod{3}$ imply that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$?!
    $endgroup$
    – stressed out
    Jul 13 '18 at 8:02






  • 1




    $begingroup$
    Because n raised to the 2015th power is congruent to n^2 mod n^3-1, hence n^2015 is congruent to n^2 mod n^2+n+1 too, since the last polynomial is a divisor of n^3-1.
    $endgroup$
    – Jack D'Aurizio
    Jul 13 '18 at 9:07














11












11








11





$begingroup$

$2015equiv 2pmod{3}$ implies that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$, so...






share|cite|improve this answer









$endgroup$



$2015equiv 2pmod{3}$ implies that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$, so...







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Aug 10 '17 at 15:41









Jack D'AurizioJack D'Aurizio

289k33281661




289k33281661












  • $begingroup$
    What is that function?
    $endgroup$
    – Adienl
    Aug 10 '17 at 15:54






  • 1




    $begingroup$
    @Adienl: the standard notation for cyclotomic polynomials: en.wikipedia.org/wiki/Cyclotomic_polynomial
    $endgroup$
    – Jack D'Aurizio
    Aug 10 '17 at 15:57










  • $begingroup$
    Hi. I do not understand. Why does $2015equiv 2pmod{3}$ imply that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$?!
    $endgroup$
    – stressed out
    Jul 13 '18 at 8:02






  • 1




    $begingroup$
    Because n raised to the 2015th power is congruent to n^2 mod n^3-1, hence n^2015 is congruent to n^2 mod n^2+n+1 too, since the last polynomial is a divisor of n^3-1.
    $endgroup$
    – Jack D'Aurizio
    Jul 13 '18 at 9:07


















  • $begingroup$
    What is that function?
    $endgroup$
    – Adienl
    Aug 10 '17 at 15:54






  • 1




    $begingroup$
    @Adienl: the standard notation for cyclotomic polynomials: en.wikipedia.org/wiki/Cyclotomic_polynomial
    $endgroup$
    – Jack D'Aurizio
    Aug 10 '17 at 15:57










  • $begingroup$
    Hi. I do not understand. Why does $2015equiv 2pmod{3}$ imply that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$?!
    $endgroup$
    – stressed out
    Jul 13 '18 at 8:02






  • 1




    $begingroup$
    Because n raised to the 2015th power is congruent to n^2 mod n^3-1, hence n^2015 is congruent to n^2 mod n^2+n+1 too, since the last polynomial is a divisor of n^3-1.
    $endgroup$
    – Jack D'Aurizio
    Jul 13 '18 at 9:07
















$begingroup$
What is that function?
$endgroup$
– Adienl
Aug 10 '17 at 15:54




$begingroup$
What is that function?
$endgroup$
– Adienl
Aug 10 '17 at 15:54




1




1




$begingroup$
@Adienl: the standard notation for cyclotomic polynomials: en.wikipedia.org/wiki/Cyclotomic_polynomial
$endgroup$
– Jack D'Aurizio
Aug 10 '17 at 15:57




$begingroup$
@Adienl: the standard notation for cyclotomic polynomials: en.wikipedia.org/wiki/Cyclotomic_polynomial
$endgroup$
– Jack D'Aurizio
Aug 10 '17 at 15:57












$begingroup$
Hi. I do not understand. Why does $2015equiv 2pmod{3}$ imply that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$?!
$endgroup$
– stressed out
Jul 13 '18 at 8:02




$begingroup$
Hi. I do not understand. Why does $2015equiv 2pmod{3}$ imply that $Phi_3(n)=n^2+n+1$ is a divisor of $n^{2015}+n+1$?!
$endgroup$
– stressed out
Jul 13 '18 at 8:02




1




1




$begingroup$
Because n raised to the 2015th power is congruent to n^2 mod n^3-1, hence n^2015 is congruent to n^2 mod n^2+n+1 too, since the last polynomial is a divisor of n^3-1.
$endgroup$
– Jack D'Aurizio
Jul 13 '18 at 9:07




$begingroup$
Because n raised to the 2015th power is congruent to n^2 mod n^3-1, hence n^2015 is congruent to n^2 mod n^2+n+1 too, since the last polynomial is a divisor of n^3-1.
$endgroup$
– Jack D'Aurizio
Jul 13 '18 at 9:07


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2389232%2fwhen-is-n2015n1-prime%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

Human spaceflight

Image
Human spaceflight From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Space traveler" redirects here. For other uses, see Space traveler (disambiguation). @media all and (max-width:720px){.mw-parser-output .tmulti>.thumbinner{width:100%!important;max-width:none!important}.mw-parser-output .tmulti .tsingle{float:none!important;max-width:none!important;width:100%!important;text-align:center}} Apollo 11 crewmember Buzz Aldrin on the Moon, 1969 International Space Station crewmember Tracy Caldwell Dyson views the Earth, 2010 Space Shuttle Discovery heads into space with a crew aboard, STS-121 in 2006 Inside a space suit on the Canadarm, 1993 Human spaceflight (also referred to as crewed spaceflight or manned spaceflight ) is space travel with a crew or passengers aboard the spacecraft. Spacecraft carrying people may be operated directly, by human crew, or it may be e
Read more

Can not write log (Is /dev/pts mounted?) - openpty in Ubuntu-on-Windows?

Image
0 1 What exactly does the error message beginning with E: mean? I assume it has to do with the file structure on Ubuntu-on-Windows, but what exactly? The following package was automatically installed and is no longer required: os-prober Use 'apt-get autoremove' to remove it. The following extra packages will be installed: libxslt1.1 The following NEW packages will be installed: libxslt1.1 xmlstarlet 0 upgraded, 2 newly installed, 0 to remove and 0 not upgraded. Need to get 435 kB of archives. After this operation, 1023 kB of additional disk space will be used. Get:1 http://archive.ubuntu.com/ubuntu/ trusty/main libxslt1.1 amd64 1.1.28-2build1 [145 kB] Get:2 http://archive.ubuntu.com/ubuntu/ trusty/universe xmlstarlet amd64 1.5.0-1 [290 kB]
Read more

張江高科駅

Image
張江高科駅 ちょうこうこうか Zhangjiang Hi-Tech Park 所在地 中国上海市浦東新区 所属事業者 上海地鉄運営有限公司（上海軌道交通・駅詳細） 上海浦東現代有軌交通有限公司（駅詳細） テンプレートを表示 張江高科駅 各種表記 繁体字： 張江高科站 簡体字： 张江高科站 拼音 ： Zhàngjiāng Gāokē Zhàn 発音： ヂャンジャン ガオクー ヂャン 英文： Zhangjiang Hi-Tech Park Station テンプレートを表示 張江高科駅 （ちょうこうこうか-えき）は中華人民共和国上海市浦東新区に位置する、上海軌道交通2号線の駅である。 なお、張江高科駅前にある張江軌道電車の 張江地鉄駅駅 についてもここで述べる。 目次 1 利用可能な鉄道路線 2 沿革 3 駅構造 3.1 上海軌道交通 3.2 張江軌道電車 4 駅周辺 5 隣の駅 6 注釈 7 関連項目 利用可能な鉄道路線 上海軌道交通 ■ 2号線 上海浦東現代有軌交通有限公司 ■ 張江軌道電車 沿革 高架駅時代の姿 2000年12月27日 - 2号線の駅が高架駅として開業。 2010年 1月1日 - 張江軌道電車の開業に伴い、張江地鉄駅駅（停留所）を設置。 2月13日 - 駅地下化に伴い高架駅の運用停止。 2月24日 - 10日間の閉鎖を経て地下新駅の開業。 2017年2月9日 - リニューアル工事を経て再開業。乗降客の増加に対応し、ホームへのエレベーター、エスカレーターを増設、券売機エリアを拡張した [1] 。 駅構造 上海軌道交通 上海軌道交通 張江高科駅 5号口 ちょうこうこうか Zhangjiang Hi-Tech Park ◄ 竜陽路 (2.60km) (1.61km) 金科路 ► 所在地 中国上海市浦東新区松涛路 祖冲之路 （中国語版） 北緯31度12分11秒 東経121度34分50秒  /  北緯31.2
Read more