When does an equation of the form $1 over p(2^p-1-1) = 2pxy+x+y$ have no integer solutions?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
4
down vote

favorite
1












Specific equations of the form below (for different given values of p, a prime number) will either have positive integer solutions for $x$ & $y$, or will not have any integer solutions.



$$2^p-1 -1 over p = 2pxy + x + y$$



Is there a way to determine when an equation of this form has integer solutions and when it does not? (Other than just trying values in a brute force manner and eventually giving up?) A repeatable algorithmic method of determining whether there are integer solutions would be ideal, does this exist? If not, are there any tricks or techniques that work sometimes, or any suggested approaches?



For example, these have positive integer solutions:

when p=11, (1/11)*(2^(10)-1)=2*11*x*y+x+y has integer solution x=1 & y=4

when p=23, (1/23)*(2^(22)-1)=2*23*x*y+x+y has integer solution x=1 & y=3880

when p=29, (1/29)*(2^(28)-1)=2*29*x*y+x+y has integer solution x=4 & y=39727

when p=37, (1/37)*(2^(36)-1)=2*37*x*y+x+y has integer solution x=3 & y=8328624



And these do not have (positive) integer solutions:

when p=7, (1/7)*(2^(6)-1)=2*7*x*y+x+y has no integer solution

when p=13, (1/13)*(2^(12)-1)=2*13*x*y+x+y has no integer solution

when p=19, (1/19)*(2^(18)-1)=2*19*x*y+x+y has no integer solution

when p=31, (1/31)*(2^(30)-1)=2*31*x*y+x+y has no integer solution




prime-numbers integers integer-programming




share|cite|improve this question





















  • How did you find out that for $p=7,13,19,31$, there is no integer solution? Is it just an hypothesis based on computations, or do you now these facts for sure?
    – Suzet
    Jul 31 at 5:22










  • @Suzet I started with a non-prime Mersenne number has factors of the form: (2xp+1)(2yp+1). Then derived the equation I give in the question above. And in the case of p=7,13,19,31 those Mersenne numbers are Mersenne primes, so they have no factors, so there should be no integer solutions to the equation. For Mersenne numbers that are not prime, e.g. p=11,23,29,37, I was able to solve the equation for x & y and from that compute from that the factors of those Mersenne numbers. Thus I would like to see if there is a way to determine when the equation has integer solutions as a primality test.
    – user669487
    Jul 31 at 5:41










  • The given equation is equivalent to $$2^p-1=(2px+1)(2py+1)$$ but considering your comment you apparently already exploited this.
    – Peter
    Jul 31 at 11:24










  • @user669487 Actually this easily leads to a primality test which is however of very little practical use. Note that every factor of $2^p-1$ with prime number $p$ is of the form $2pk+1$
    – Peter
    Jul 31 at 11:26











  • @Peter, yes the equation you gave is essentially where I started. I'm curious in trying to figure out how to tell when it has no integer solutions for x & y given a value for p.
    – user669487
    Jul 31 at 16:10














up vote
4
down vote

favorite
1












Specific equations of the form below (for different given values of p, a prime number) will either have positive integer solutions for $x$ & $y$, or will not have any integer solutions.



$$2^p-1 -1 over p = 2pxy + x + y$$



Is there a way to determine when an equation of this form has integer solutions and when it does not? (Other than just trying values in a brute force manner and eventually giving up?) A repeatable algorithmic method of determining whether there are integer solutions would be ideal, does this exist? If not, are there any tricks or techniques that work sometimes, or any suggested approaches?



For example, these have positive integer solutions:

when p=11, (1/11)*(2^(10)-1)=2*11*x*y+x+y has integer solution x=1 & y=4

when p=23, (1/23)*(2^(22)-1)=2*23*x*y+x+y has integer solution x=1 & y=3880

when p=29, (1/29)*(2^(28)-1)=2*29*x*y+x+y has integer solution x=4 & y=39727

when p=37, (1/37)*(2^(36)-1)=2*37*x*y+x+y has integer solution x=3 & y=8328624



And these do not have (positive) integer solutions:

when p=7, (1/7)*(2^(6)-1)=2*7*x*y+x+y has no integer solution

when p=13, (1/13)*(2^(12)-1)=2*13*x*y+x+y has no integer solution

when p=19, (1/19)*(2^(18)-1)=2*19*x*y+x+y has no integer solution

when p=31, (1/31)*(2^(30)-1)=2*31*x*y+x+y has no integer solution




prime-numbers integers integer-programming




share|cite|improve this question





















  • How did you find out that for $p=7,13,19,31$, there is no integer solution? Is it just an hypothesis based on computations, or do you now these facts for sure?
    – Suzet
    Jul 31 at 5:22










  • @Suzet I started with a non-prime Mersenne number has factors of the form: (2xp+1)(2yp+1). Then derived the equation I give in the question above. And in the case of p=7,13,19,31 those Mersenne numbers are Mersenne primes, so they have no factors, so there should be no integer solutions to the equation. For Mersenne numbers that are not prime, e.g. p=11,23,29,37, I was able to solve the equation for x & y and from that compute from that the factors of those Mersenne numbers. Thus I would like to see if there is a way to determine when the equation has integer solutions as a primality test.
    – user669487
    Jul 31 at 5:41










  • The given equation is equivalent to $$2^p-1=(2px+1)(2py+1)$$ but considering your comment you apparently already exploited this.
    – Peter
    Jul 31 at 11:24










  • @user669487 Actually this easily leads to a primality test which is however of very little practical use. Note that every factor of $2^p-1$ with prime number $p$ is of the form $2pk+1$
    – Peter
    Jul 31 at 11:26











  • @Peter, yes the equation you gave is essentially where I started. I'm curious in trying to figure out how to tell when it has no integer solutions for x & y given a value for p.
    – user669487
    Jul 31 at 16:10












up vote
4
down vote

favorite
1









up vote
4
down vote

favorite
1






1





Specific equations of the form below (for different given values of p, a prime number) will either have positive integer solutions for $x$ & $y$, or will not have any integer solutions.



$$2^p-1 -1 over p = 2pxy + x + y$$



Is there a way to determine when an equation of this form has integer solutions and when it does not? (Other than just trying values in a brute force manner and eventually giving up?) A repeatable algorithmic method of determining whether there are integer solutions would be ideal, does this exist? If not, are there any tricks or techniques that work sometimes, or any suggested approaches?



For example, these have positive integer solutions:

when p=11, (1/11)*(2^(10)-1)=2*11*x*y+x+y has integer solution x=1 & y=4

when p=23, (1/23)*(2^(22)-1)=2*23*x*y+x+y has integer solution x=1 & y=3880

when p=29, (1/29)*(2^(28)-1)=2*29*x*y+x+y has integer solution x=4 & y=39727

when p=37, (1/37)*(2^(36)-1)=2*37*x*y+x+y has integer solution x=3 & y=8328624



And these do not have (positive) integer solutions:

when p=7, (1/7)*(2^(6)-1)=2*7*x*y+x+y has no integer solution

when p=13, (1/13)*(2^(12)-1)=2*13*x*y+x+y has no integer solution

when p=19, (1/19)*(2^(18)-1)=2*19*x*y+x+y has no integer solution

when p=31, (1/31)*(2^(30)-1)=2*31*x*y+x+y has no integer solution




prime-numbers integers integer-programming




share|cite|improve this question













Specific equations of the form below (for different given values of p, a prime number) will either have positive integer solutions for $x$ & $y$, or will not have any integer solutions.



$$2^p-1 -1 over p = 2pxy + x + y$$



Is there a way to determine when an equation of this form has integer solutions and when it does not? (Other than just trying values in a brute force manner and eventually giving up?) A repeatable algorithmic method of determining whether there are integer solutions would be ideal, does this exist? If not, are there any tricks or techniques that work sometimes, or any suggested approaches?



For example, these have positive integer solutions:

when p=11, (1/11)*(2^(10)-1)=2*11*x*y+x+y has integer solution x=1 & y=4

when p=23, (1/23)*(2^(22)-1)=2*23*x*y+x+y has integer solution x=1 & y=3880

when p=29, (1/29)*(2^(28)-1)=2*29*x*y+x+y has integer solution x=4 & y=39727

when p=37, (1/37)*(2^(36)-1)=2*37*x*y+x+y has integer solution x=3 & y=8328624



And these do not have (positive) integer solutions:

when p=7, (1/7)*(2^(6)-1)=2*7*x*y+x+y has no integer solution

when p=13, (1/13)*(2^(12)-1)=2*13*x*y+x+y has no integer solution

when p=19, (1/19)*(2^(18)-1)=2*19*x*y+x+y has no integer solution

when p=31, (1/31)*(2^(30)-1)=2*31*x*y+x+y has no integer solution





prime-numbers integers integer-programming





share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited Jul 31 at 16:27
























asked Jul 31 at 5:19









user669487

662




662











  • How did you find out that for $p=7,13,19,31$, there is no integer solution? Is it just an hypothesis based on computations, or do you now these facts for sure?
    – Suzet
    Jul 31 at 5:22










  • @Suzet I started with a non-prime Mersenne number has factors of the form: (2xp+1)(2yp+1). Then derived the equation I give in the question above. And in the case of p=7,13,19,31 those Mersenne numbers are Mersenne primes, so they have no factors, so there should be no integer solutions to the equation. For Mersenne numbers that are not prime, e.g. p=11,23,29,37, I was able to solve the equation for x & y and from that compute from that the factors of those Mersenne numbers. Thus I would like to see if there is a way to determine when the equation has integer solutions as a primality test.
    – user669487
    Jul 31 at 5:41










  • The given equation is equivalent to $$2^p-1=(2px+1)(2py+1)$$ but considering your comment you apparently already exploited this.
    – Peter
    Jul 31 at 11:24










  • @user669487 Actually this easily leads to a primality test which is however of very little practical use. Note that every factor of $2^p-1$ with prime number $p$ is of the form $2pk+1$
    – Peter
    Jul 31 at 11:26











  • @Peter, yes the equation you gave is essentially where I started. I'm curious in trying to figure out how to tell when it has no integer solutions for x & y given a value for p.
    – user669487
    Jul 31 at 16:10
















  • How did you find out that for $p=7,13,19,31$, there is no integer solution? Is it just an hypothesis based on computations, or do you now these facts for sure?
    – Suzet
    Jul 31 at 5:22










  • @Suzet I started with a non-prime Mersenne number has factors of the form: (2xp+1)(2yp+1). Then derived the equation I give in the question above. And in the case of p=7,13,19,31 those Mersenne numbers are Mersenne primes, so they have no factors, so there should be no integer solutions to the equation. For Mersenne numbers that are not prime, e.g. p=11,23,29,37, I was able to solve the equation for x & y and from that compute from that the factors of those Mersenne numbers. Thus I would like to see if there is a way to determine when the equation has integer solutions as a primality test.
    – user669487
    Jul 31 at 5:41










  • The given equation is equivalent to $$2^p-1=(2px+1)(2py+1)$$ but considering your comment you apparently already exploited this.
    – Peter
    Jul 31 at 11:24










  • @user669487 Actually this easily leads to a primality test which is however of very little practical use. Note that every factor of $2^p-1$ with prime number $p$ is of the form $2pk+1$
    – Peter
    Jul 31 at 11:26











  • @Peter, yes the equation you gave is essentially where I started. I'm curious in trying to figure out how to tell when it has no integer solutions for x & y given a value for p.
    – user669487
    Jul 31 at 16:10















How did you find out that for $p=7,13,19,31$, there is no integer solution? Is it just an hypothesis based on computations, or do you now these facts for sure?
– Suzet
Jul 31 at 5:22




How did you find out that for $p=7,13,19,31$, there is no integer solution? Is it just an hypothesis based on computations, or do you now these facts for sure?
– Suzet
Jul 31 at 5:22












@Suzet I started with a non-prime Mersenne number has factors of the form: (2xp+1)(2yp+1). Then derived the equation I give in the question above. And in the case of p=7,13,19,31 those Mersenne numbers are Mersenne primes, so they have no factors, so there should be no integer solutions to the equation. For Mersenne numbers that are not prime, e.g. p=11,23,29,37, I was able to solve the equation for x & y and from that compute from that the factors of those Mersenne numbers. Thus I would like to see if there is a way to determine when the equation has integer solutions as a primality test.
– user669487
Jul 31 at 5:41




@Suzet I started with a non-prime Mersenne number has factors of the form: (2xp+1)(2yp+1). Then derived the equation I give in the question above. And in the case of p=7,13,19,31 those Mersenne numbers are Mersenne primes, so they have no factors, so there should be no integer solutions to the equation. For Mersenne numbers that are not prime, e.g. p=11,23,29,37, I was able to solve the equation for x & y and from that compute from that the factors of those Mersenne numbers. Thus I would like to see if there is a way to determine when the equation has integer solutions as a primality test.
– user669487
Jul 31 at 5:41












The given equation is equivalent to $$2^p-1=(2px+1)(2py+1)$$ but considering your comment you apparently already exploited this.
– Peter
Jul 31 at 11:24




The given equation is equivalent to $$2^p-1=(2px+1)(2py+1)$$ but considering your comment you apparently already exploited this.
– Peter
Jul 31 at 11:24












@user669487 Actually this easily leads to a primality test which is however of very little practical use. Note that every factor of $2^p-1$ with prime number $p$ is of the form $2pk+1$
– Peter
Jul 31 at 11:26





@user669487 Actually this easily leads to a primality test which is however of very little practical use. Note that every factor of $2^p-1$ with prime number $p$ is of the form $2pk+1$
– Peter
Jul 31 at 11:26













@Peter, yes the equation you gave is essentially where I started. I'm curious in trying to figure out how to tell when it has no integer solutions for x & y given a value for p.
– user669487
Jul 31 at 16:10




@Peter, yes the equation you gave is essentially where I started. I'm curious in trying to figure out how to tell when it has no integer solutions for x & y given a value for p.
– user669487
Jul 31 at 16:10















active

oldest

votes











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',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
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%2f2867686%2fwhen-does-an-equation-of-the-form-1-over-p2p-1-1-2pxyxy-have-no%23new-answer', 'question_page');

);

Post as a guest






















active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes










 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2867686%2fwhen-does-an-equation-of-the-form-1-over-p2p-1-1-2pxyxy-have-no%23new-answer', 'question_page');

);

Post as a guest
































































Comments

Post a Comment

Popular posts from this blog

What is the equation of a 3D cone with generalised tilt?

Image
Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite What is the equation of a 3D cone with generalized tilt? I've noticed that in most equations given to represent a cone, there is no parameter which defines the tilt of the cone in 3D space and that most of them have their point at the origin $(0,0,0)$ - I was wondering if anyone could give me a more generalized cone equation for a cone in any position in 3D space 3d share | cite | improve this question edited Jul 25 '16 at 0:05 ervx 9,425 3 13 36 asked Jul 24 '16 at 15:38 Charlene 11 2 2 Welcome to Math.SE! Could you please explain a few things to help people give an answer useful to you: 1. What do you mean by "generalized tilt"? 2. Are you asking about a right circular cone? Does the angle at the vertex matter? 3. What form of answer (implicit, parametric...?) are you looking for? 4. If this is homework, what tools do you have available, an...
Read more

Color the edges and diagonals of a regular polygon

Image
Clash Royale CLAN TAG #URR8PPP up vote 5 down vote favorite 1 Here is the problem: For what $n$ is it possible to color the edges and diagonals of an $n$-side regular polygon with $dfracbinomn23$ colors, such that you use every color exactly three times and for every color the three segments (edges or diagonals) with that color form a triangle? Trivially $nequiv 0 text or 1 pmod3$. I can also prove that if the statement is true for $k$ than it is true for $3k$ as well. How to finish? Please help! Thanks combinatorial-geometry share | cite | improve this question edited Aug 6 at 21:57 alcana 118 4 asked Aug 6 at 21:15 Leo Gardner 356 11 Even assuming "polyhpn" in the title is a typo for polygon , it is unclear what you mean by "the edges and sides". Aren't the side of a regular polygon the same as the edges? A regular $n$-sided polygon has $n$ edges. – hardmath Aug 6 at 21:20 3 $n$ ne...
Read more

Relationship between determinant of matrix and determinant of adjoint?

Image
Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite We are studying adjoints in class, and I was curious if there is a relationship between the determinant of matrix A, and the determinant of the adjoint of matrix A? I assume there would be a relationship because finding the adjoint requires creating a cofactor matrix and then transposing it. linear-algebra determinant adjoint-operators share | cite | improve this question asked Nov 17 '17 at 17:32 CluelessCoder 32 5 For a square matrix $A$ of order $n$, we have $A(operatornameadj A)=(operatornameadj A)A=|A|I_n$ where $I_n$ is the identity matrix of order $n$. This should tell you about the determinant of the adjoint in terms of that of $A$ (use multiplicative property and other elementary properties of determinants). – Prasun Biswas Nov 17 '17 at 17:35 1 @CluelessCoder: see here: math.stackexchange.com/questions/516127/…...
Read more