Do further prime numbers of the form $n^n+varphi(n)$ exist?

Clash Royale CLAN TAG#URR8PPP
up vote
7
down vote
favorite
Can the expression $$n^n+varphi(n)$$ be a prime number for some integer $n>19$ ?
For $n=1,2,3,19$ and no other positive integer $nle 3 000$, the expression is prime. A further prime of the desired form must have more than $10 000$ digits. For $n>2$, only odd $n$ need to be considered because $varphi(n)$ is even for $n>2$
Moreover, I search a prime factor of the composite $283$-digit number $$f(133)=133^133+108$$ Probably , there is no prime factor with $20$ digits or less.
number-theory elementary-number-theory prime-numbers totient-function
This question has an open bounty worth +50
reputation from Yanior Weg ending ending at 2018-08-28 08:53:10Z">in 5 days.
This question has not received enough attention.
 |Â
show 7 more comments
up vote
7
down vote
favorite
Can the expression $$n^n+varphi(n)$$ be a prime number for some integer $n>19$ ?
For $n=1,2,3,19$ and no other positive integer $nle 3 000$, the expression is prime. A further prime of the desired form must have more than $10 000$ digits. For $n>2$, only odd $n$ need to be considered because $varphi(n)$ is even for $n>2$
Moreover, I search a prime factor of the composite $283$-digit number $$f(133)=133^133+108$$ Probably , there is no prime factor with $20$ digits or less.
number-theory elementary-number-theory prime-numbers totient-function
This question has an open bounty worth +50
reputation from Yanior Weg ending ending at 2018-08-28 08:53:10Z">in 5 days.
This question has not received enough attention.
3
You only need to check values of $n$ that are square-free, since if $p^2mid n$ then $pmid phi(n)$ and hence $pmid n^n+phi(n).$
â Thomas Andrews
Aug 9 at 16:54
1
Does not exist for $nle 2000$. Checking more currently. Edit: didn't see you already checked. I'll let it run some more and let you know.
â Elliot G
Aug 9 at 17:23
1
@Wojowu No, I just like to play around with expressions.
â Peter
Aug 9 at 17:50
1
No primes for $nle 5000$.
â Elliot G
Aug 9 at 18:22
3
$f(7069)$ is probable-prime! factordb.com/â¦
â Peter
Aug 9 at 21:32
 |Â
show 7 more comments
up vote
7
down vote
favorite
up vote
7
down vote
favorite
Can the expression $$n^n+varphi(n)$$ be a prime number for some integer $n>19$ ?
For $n=1,2,3,19$ and no other positive integer $nle 3 000$, the expression is prime. A further prime of the desired form must have more than $10 000$ digits. For $n>2$, only odd $n$ need to be considered because $varphi(n)$ is even for $n>2$
Moreover, I search a prime factor of the composite $283$-digit number $$f(133)=133^133+108$$ Probably , there is no prime factor with $20$ digits or less.
number-theory elementary-number-theory prime-numbers totient-function
Can the expression $$n^n+varphi(n)$$ be a prime number for some integer $n>19$ ?
For $n=1,2,3,19$ and no other positive integer $nle 3 000$, the expression is prime. A further prime of the desired form must have more than $10 000$ digits. For $n>2$, only odd $n$ need to be considered because $varphi(n)$ is even for $n>2$
Moreover, I search a prime factor of the composite $283$-digit number $$f(133)=133^133+108$$ Probably , there is no prime factor with $20$ digits or less.
number-theory elementary-number-theory prime-numbers totient-function
asked Aug 9 at 16:44
Peter
45.2k939119
45.2k939119
This question has an open bounty worth +50
reputation from Yanior Weg ending ending at 2018-08-28 08:53:10Z">in 5 days.
This question has not received enough attention.
This question has an open bounty worth +50
reputation from Yanior Weg ending ending at 2018-08-28 08:53:10Z">in 5 days.
This question has not received enough attention.
3
You only need to check values of $n$ that are square-free, since if $p^2mid n$ then $pmid phi(n)$ and hence $pmid n^n+phi(n).$
â Thomas Andrews
Aug 9 at 16:54
1
Does not exist for $nle 2000$. Checking more currently. Edit: didn't see you already checked. I'll let it run some more and let you know.
â Elliot G
Aug 9 at 17:23
1
@Wojowu No, I just like to play around with expressions.
â Peter
Aug 9 at 17:50
1
No primes for $nle 5000$.
â Elliot G
Aug 9 at 18:22
3
$f(7069)$ is probable-prime! factordb.com/â¦
â Peter
Aug 9 at 21:32
 |Â
show 7 more comments
3
You only need to check values of $n$ that are square-free, since if $p^2mid n$ then $pmid phi(n)$ and hence $pmid n^n+phi(n).$
â Thomas Andrews
Aug 9 at 16:54
1
Does not exist for $nle 2000$. Checking more currently. Edit: didn't see you already checked. I'll let it run some more and let you know.
â Elliot G
Aug 9 at 17:23
1
@Wojowu No, I just like to play around with expressions.
â Peter
Aug 9 at 17:50
1
No primes for $nle 5000$.
â Elliot G
Aug 9 at 18:22
3
$f(7069)$ is probable-prime! factordb.com/â¦
â Peter
Aug 9 at 21:32
3
3
You only need to check values of $n$ that are square-free, since if $p^2mid n$ then $pmid phi(n)$ and hence $pmid n^n+phi(n).$
â Thomas Andrews
Aug 9 at 16:54
You only need to check values of $n$ that are square-free, since if $p^2mid n$ then $pmid phi(n)$ and hence $pmid n^n+phi(n).$
â Thomas Andrews
Aug 9 at 16:54
1
1
Does not exist for $nle 2000$. Checking more currently. Edit: didn't see you already checked. I'll let it run some more and let you know.
â Elliot G
Aug 9 at 17:23
Does not exist for $nle 2000$. Checking more currently. Edit: didn't see you already checked. I'll let it run some more and let you know.
â Elliot G
Aug 9 at 17:23
1
1
@Wojowu No, I just like to play around with expressions.
â Peter
Aug 9 at 17:50
@Wojowu No, I just like to play around with expressions.
â Peter
Aug 9 at 17:50
1
1
No primes for $nle 5000$.
â Elliot G
Aug 9 at 18:22
No primes for $nle 5000$.
â Elliot G
Aug 9 at 18:22
3
3
$f(7069)$ is probable-prime! factordb.com/â¦
â Peter
Aug 9 at 21:32
$f(7069)$ is probable-prime! factordb.com/â¦
â Peter
Aug 9 at 21:32
 |Â
show 7 more comments
1 Answer
1
active
oldest
votes
up vote
0
down vote
Since you found no prime with composite $n$ for $n leq 10^4$ the only explanation that I am aware of is that $phi(n)$ is very likely to have form $phi(n)=2r(n)$, where $r(n)$ is either a prime dividing $n$ or is divisible by a prime that also divides $n$.
So, further study of function $phi$ is needed, that is, to determine for which $n$ we have that there is a prime $p$ that divides both $n$ and $phi(n)$.
It could be that quite often we have $phi (n)=m(n) cdot p(n)$, where $m(n)$ is even and $p(n)$ is some prime dividing $n$, because then we could not have $phi(n)=m(n) cdot p(n) | (n-1)$ because of $p(n)|n$ and that would be in favour of Lehmerôs conjecture.
1
This is a nice comment but not an answer.
â mathworker21
18 hours ago
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
Since you found no prime with composite $n$ for $n leq 10^4$ the only explanation that I am aware of is that $phi(n)$ is very likely to have form $phi(n)=2r(n)$, where $r(n)$ is either a prime dividing $n$ or is divisible by a prime that also divides $n$.
So, further study of function $phi$ is needed, that is, to determine for which $n$ we have that there is a prime $p$ that divides both $n$ and $phi(n)$.
It could be that quite often we have $phi (n)=m(n) cdot p(n)$, where $m(n)$ is even and $p(n)$ is some prime dividing $n$, because then we could not have $phi(n)=m(n) cdot p(n) | (n-1)$ because of $p(n)|n$ and that would be in favour of Lehmerôs conjecture.
1
This is a nice comment but not an answer.
â mathworker21
18 hours ago
add a comment |Â
up vote
0
down vote
Since you found no prime with composite $n$ for $n leq 10^4$ the only explanation that I am aware of is that $phi(n)$ is very likely to have form $phi(n)=2r(n)$, where $r(n)$ is either a prime dividing $n$ or is divisible by a prime that also divides $n$.
So, further study of function $phi$ is needed, that is, to determine for which $n$ we have that there is a prime $p$ that divides both $n$ and $phi(n)$.
It could be that quite often we have $phi (n)=m(n) cdot p(n)$, where $m(n)$ is even and $p(n)$ is some prime dividing $n$, because then we could not have $phi(n)=m(n) cdot p(n) | (n-1)$ because of $p(n)|n$ and that would be in favour of Lehmerôs conjecture.
1
This is a nice comment but not an answer.
â mathworker21
18 hours ago
add a comment |Â
up vote
0
down vote
up vote
0
down vote
Since you found no prime with composite $n$ for $n leq 10^4$ the only explanation that I am aware of is that $phi(n)$ is very likely to have form $phi(n)=2r(n)$, where $r(n)$ is either a prime dividing $n$ or is divisible by a prime that also divides $n$.
So, further study of function $phi$ is needed, that is, to determine for which $n$ we have that there is a prime $p$ that divides both $n$ and $phi(n)$.
It could be that quite often we have $phi (n)=m(n) cdot p(n)$, where $m(n)$ is even and $p(n)$ is some prime dividing $n$, because then we could not have $phi(n)=m(n) cdot p(n) | (n-1)$ because of $p(n)|n$ and that would be in favour of Lehmerôs conjecture.
Since you found no prime with composite $n$ for $n leq 10^4$ the only explanation that I am aware of is that $phi(n)$ is very likely to have form $phi(n)=2r(n)$, where $r(n)$ is either a prime dividing $n$ or is divisible by a prime that also divides $n$.
So, further study of function $phi$ is needed, that is, to determine for which $n$ we have that there is a prime $p$ that divides both $n$ and $phi(n)$.
It could be that quite often we have $phi (n)=m(n) cdot p(n)$, where $m(n)$ is even and $p(n)$ is some prime dividing $n$, because then we could not have $phi(n)=m(n) cdot p(n) | (n-1)$ because of $p(n)|n$ and that would be in favour of Lehmerôs conjecture.
answered 22 hours ago
Right
4057
4057
1
This is a nice comment but not an answer.
â mathworker21
18 hours ago
add a comment |Â
1
This is a nice comment but not an answer.
â mathworker21
18 hours ago
1
1
This is a nice comment but not an answer.
â mathworker21
18 hours ago
This is a nice comment but not an answer.
â mathworker21
18 hours ago
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2877432%2fdo-further-prime-numbers-of-the-form-nn-varphin-exist%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
3
You only need to check values of $n$ that are square-free, since if $p^2mid n$ then $pmid phi(n)$ and hence $pmid n^n+phi(n).$
â Thomas Andrews
Aug 9 at 16:54
1
Does not exist for $nle 2000$. Checking more currently. Edit: didn't see you already checked. I'll let it run some more and let you know.
â Elliot G
Aug 9 at 17:23
1
@Wojowu No, I just like to play around with expressions.
â Peter
Aug 9 at 17:50
1
No primes for $nle 5000$.
â Elliot G
Aug 9 at 18:22
3
$f(7069)$ is probable-prime! factordb.com/â¦
â Peter
Aug 9 at 21:32