How likely is a disproof of the conjecture that $2^q-1$ is squarefree whenever $q$ is prime?
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
For the known Wieferich primes $1093$ and $3511$, we have the property that $$ord_2(p)=ord_2(p^2)$$ I have the following questions :
- Is the property that the orders modulo $2$ of $p$ and $p^2$ coincide true for every Wieferich prime, or is it just a coincidence that it is true for the known Wieferich-primes ?
- Can we estimate the chance, that a further Wieferich prime $p$ with, lets say, $20$ digits, has the property that $ord_2(p^2)$ is a prime ?
As far as I know, infinite many Wieferich primes are expected. If we would find a Wieferich prime $p$ such that $ord_2(p^2)$ is prime , we would have disproven that $2^q-1$ with prime exponent $q$ is always squarefree. I would like to know how likely this is.
elementary-number-theory prime-numbers
add a comment |Â
up vote
0
down vote
favorite
For the known Wieferich primes $1093$ and $3511$, we have the property that $$ord_2(p)=ord_2(p^2)$$ I have the following questions :
- Is the property that the orders modulo $2$ of $p$ and $p^2$ coincide true for every Wieferich prime, or is it just a coincidence that it is true for the known Wieferich-primes ?
- Can we estimate the chance, that a further Wieferich prime $p$ with, lets say, $20$ digits, has the property that $ord_2(p^2)$ is a prime ?
As far as I know, infinite many Wieferich primes are expected. If we would find a Wieferich prime $p$ such that $ord_2(p^2)$ is prime , we would have disproven that $2^q-1$ with prime exponent $q$ is always squarefree. I would like to know how likely this is.
elementary-number-theory prime-numbers
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
For the known Wieferich primes $1093$ and $3511$, we have the property that $$ord_2(p)=ord_2(p^2)$$ I have the following questions :
- Is the property that the orders modulo $2$ of $p$ and $p^2$ coincide true for every Wieferich prime, or is it just a coincidence that it is true for the known Wieferich-primes ?
- Can we estimate the chance, that a further Wieferich prime $p$ with, lets say, $20$ digits, has the property that $ord_2(p^2)$ is a prime ?
As far as I know, infinite many Wieferich primes are expected. If we would find a Wieferich prime $p$ such that $ord_2(p^2)$ is prime , we would have disproven that $2^q-1$ with prime exponent $q$ is always squarefree. I would like to know how likely this is.
elementary-number-theory prime-numbers
For the known Wieferich primes $1093$ and $3511$, we have the property that $$ord_2(p)=ord_2(p^2)$$ I have the following questions :
- Is the property that the orders modulo $2$ of $p$ and $p^2$ coincide true for every Wieferich prime, or is it just a coincidence that it is true for the known Wieferich-primes ?
- Can we estimate the chance, that a further Wieferich prime $p$ with, lets say, $20$ digits, has the property that $ord_2(p^2)$ is a prime ?
As far as I know, infinite many Wieferich primes are expected. If we would find a Wieferich prime $p$ such that $ord_2(p^2)$ is prime , we would have disproven that $2^q-1$ with prime exponent $q$ is always squarefree. I would like to know how likely this is.
elementary-number-theory prime-numbers
asked Aug 18 at 7:46
Peter
45.3k1039119
45.3k1039119
add a comment |Â
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f2886509%2fhow-likely-is-a-disproof-of-the-conjecture-that-2q-1-is-squarefree-whenever%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