Congruences mod p#












1












$begingroup$


Maybe the following can be done by induction or maybe there is some group-theoretical approach that I am unlikely to see. Thanks for any hints or thoughts.




$(cdot)$ is an exclusive interval. Let $p#$ be the product of primes not exceeding $p.$ Let $q=p#-p^2.$



Claim. There is always an integer $n$ in $(1,2p)$ such that $nnotequiv q $ mod $(2,3,...,p).$




To be clear, $n$ cannot have the same congruence as q mod any prime $leq p.$ I am not sure what the term for that is and have been thinking of it as "co-mod" (comod). For example, 6 and 11 are coprime but both are congruent to 1 mod 5 hence not comod.



Example. Let $p=5. $ Then $q=(2cdot3cdot5)-5^2=5.$ Now $5equiv (1,2,0)~$(mod $2,3,5).$ Because 5 is on the interval $(1,10)$ it is easy to check that $(5pm1)$ both satisfy the requirement: $4equiv (0,1,4)$ and $6equiv (0,0,1)$ (mod $2,3,5)$ and both are $notequiv 5$ mod $2,3,$ or $5.$



Induction seemed like an approach that might work. In general we have a $q = (1,2,a,b,c,...,0)$ (mod $2,3,5,7,11,...,p$). Starting with 5 on the inteval $(1, 2p)$ we can imagine for small numbers how the position of $a,b,c,...$ can prevent non-congruence. For larger numbers the unknown quantities can begin to interact and so this seems obscure.



Group theory? There are probably group theoretical properties of comods that are beyond me. For example, coprimes to $5#$ on $[1,5#)$ seem to be a special case of comods in the sense that the comods to any number on $[1,30]$ give a partition of this interval into non-disjoint classes of 8 members, the comods/coprimes to 30 being the usual $(1,7,11,13,17,19,23,29).$ It also seems true that there are 8 natural groupings of these classes:(30,1), (2-7), (8-11), (12,13), (14-17),(18,19), (20-23), (24-29) but this is only meant as an indication of what I have looked at (without success).






group-theory number-theory prime-numbers modular-arithmetic







share|cite|improve this question









$endgroup$












  • $begingroup$
    not going to bump this--just to correct: there are 30 nondisjoint partitions and they do not form "natural groupings". this was an artifact of my listing.
    $endgroup$
    – daniel
    Jan 13 at 8:41
















1












$begingroup$


Maybe the following can be done by induction or maybe there is some group-theoretical approach that I am unlikely to see. Thanks for any hints or thoughts.




$(cdot)$ is an exclusive interval. Let $p#$ be the product of primes not exceeding $p.$ Let $q=p#-p^2.$



Claim. There is always an integer $n$ in $(1,2p)$ such that $nnotequiv q $ mod $(2,3,...,p).$




To be clear, $n$ cannot have the same congruence as q mod any prime $leq p.$ I am not sure what the term for that is and have been thinking of it as "co-mod" (comod). For example, 6 and 11 are coprime but both are congruent to 1 mod 5 hence not comod.



Example. Let $p=5. $ Then $q=(2cdot3cdot5)-5^2=5.$ Now $5equiv (1,2,0)~$(mod $2,3,5).$ Because 5 is on the interval $(1,10)$ it is easy to check that $(5pm1)$ both satisfy the requirement: $4equiv (0,1,4)$ and $6equiv (0,0,1)$ (mod $2,3,5)$ and both are $notequiv 5$ mod $2,3,$ or $5.$



Induction seemed like an approach that might work. In general we have a $q = (1,2,a,b,c,...,0)$ (mod $2,3,5,7,11,...,p$). Starting with 5 on the inteval $(1, 2p)$ we can imagine for small numbers how the position of $a,b,c,...$ can prevent non-congruence. For larger numbers the unknown quantities can begin to interact and so this seems obscure.



Group theory? There are probably group theoretical properties of comods that are beyond me. For example, coprimes to $5#$ on $[1,5#)$ seem to be a special case of comods in the sense that the comods to any number on $[1,30]$ give a partition of this interval into non-disjoint classes of 8 members, the comods/coprimes to 30 being the usual $(1,7,11,13,17,19,23,29).$ It also seems true that there are 8 natural groupings of these classes:(30,1), (2-7), (8-11), (12,13), (14-17),(18,19), (20-23), (24-29) but this is only meant as an indication of what I have looked at (without success).






group-theory number-theory prime-numbers modular-arithmetic







share|cite|improve this question









$endgroup$












  • $begingroup$
    not going to bump this--just to correct: there are 30 nondisjoint partitions and they do not form "natural groupings". this was an artifact of my listing.
    $endgroup$
    – daniel
    Jan 13 at 8:41














1












1








1





$begingroup$


Maybe the following can be done by induction or maybe there is some group-theoretical approach that I am unlikely to see. Thanks for any hints or thoughts.




$(cdot)$ is an exclusive interval. Let $p#$ be the product of primes not exceeding $p.$ Let $q=p#-p^2.$



Claim. There is always an integer $n$ in $(1,2p)$ such that $nnotequiv q $ mod $(2,3,...,p).$




To be clear, $n$ cannot have the same congruence as q mod any prime $leq p.$ I am not sure what the term for that is and have been thinking of it as "co-mod" (comod). For example, 6 and 11 are coprime but both are congruent to 1 mod 5 hence not comod.



Example. Let $p=5. $ Then $q=(2cdot3cdot5)-5^2=5.$ Now $5equiv (1,2,0)~$(mod $2,3,5).$ Because 5 is on the interval $(1,10)$ it is easy to check that $(5pm1)$ both satisfy the requirement: $4equiv (0,1,4)$ and $6equiv (0,0,1)$ (mod $2,3,5)$ and both are $notequiv 5$ mod $2,3,$ or $5.$



Induction seemed like an approach that might work. In general we have a $q = (1,2,a,b,c,...,0)$ (mod $2,3,5,7,11,...,p$). Starting with 5 on the inteval $(1, 2p)$ we can imagine for small numbers how the position of $a,b,c,...$ can prevent non-congruence. For larger numbers the unknown quantities can begin to interact and so this seems obscure.



Group theory? There are probably group theoretical properties of comods that are beyond me. For example, coprimes to $5#$ on $[1,5#)$ seem to be a special case of comods in the sense that the comods to any number on $[1,30]$ give a partition of this interval into non-disjoint classes of 8 members, the comods/coprimes to 30 being the usual $(1,7,11,13,17,19,23,29).$ It also seems true that there are 8 natural groupings of these classes:(30,1), (2-7), (8-11), (12,13), (14-17),(18,19), (20-23), (24-29) but this is only meant as an indication of what I have looked at (without success).






group-theory number-theory prime-numbers modular-arithmetic







share|cite|improve this question









$endgroup$




Maybe the following can be done by induction or maybe there is some group-theoretical approach that I am unlikely to see. Thanks for any hints or thoughts.




$(cdot)$ is an exclusive interval. Let $p#$ be the product of primes not exceeding $p.$ Let $q=p#-p^2.$



Claim. There is always an integer $n$ in $(1,2p)$ such that $nnotequiv q $ mod $(2,3,...,p).$




To be clear, $n$ cannot have the same congruence as q mod any prime $leq p.$ I am not sure what the term for that is and have been thinking of it as "co-mod" (comod). For example, 6 and 11 are coprime but both are congruent to 1 mod 5 hence not comod.



Example. Let $p=5. $ Then $q=(2cdot3cdot5)-5^2=5.$ Now $5equiv (1,2,0)~$(mod $2,3,5).$ Because 5 is on the interval $(1,10)$ it is easy to check that $(5pm1)$ both satisfy the requirement: $4equiv (0,1,4)$ and $6equiv (0,0,1)$ (mod $2,3,5)$ and both are $notequiv 5$ mod $2,3,$ or $5.$



Induction seemed like an approach that might work. In general we have a $q = (1,2,a,b,c,...,0)$ (mod $2,3,5,7,11,...,p$). Starting with 5 on the inteval $(1, 2p)$ we can imagine for small numbers how the position of $a,b,c,...$ can prevent non-congruence. For larger numbers the unknown quantities can begin to interact and so this seems obscure.



Group theory? There are probably group theoretical properties of comods that are beyond me. For example, coprimes to $5#$ on $[1,5#)$ seem to be a special case of comods in the sense that the comods to any number on $[1,30]$ give a partition of this interval into non-disjoint classes of 8 members, the comods/coprimes to 30 being the usual $(1,7,11,13,17,19,23,29).$ It also seems true that there are 8 natural groupings of these classes:(30,1), (2-7), (8-11), (12,13), (14-17),(18,19), (20-23), (24-29) but this is only meant as an indication of what I have looked at (without success).






group-theory number-theory prime-numbers modular-arithmetic




group-theory number-theory prime-numbers modular-arithmetic






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 8 at 22:13









danieldaniel

6,26922258




6,26922258












  • $begingroup$
    not going to bump this--just to correct: there are 30 nondisjoint partitions and they do not form "natural groupings". this was an artifact of my listing.
    $endgroup$
    – daniel
    Jan 13 at 8:41


















  • $begingroup$
    not going to bump this--just to correct: there are 30 nondisjoint partitions and they do not form "natural groupings". this was an artifact of my listing.
    $endgroup$
    – daniel
    Jan 13 at 8:41
















$begingroup$
not going to bump this--just to correct: there are 30 nondisjoint partitions and they do not form "natural groupings". this was an artifact of my listing.
$endgroup$
– daniel
Jan 13 at 8:41




$begingroup$
not going to bump this--just to correct: there are 30 nondisjoint partitions and they do not form "natural groupings". this was an artifact of my listing.
$endgroup$
– daniel
Jan 13 at 8:41










1 Answer
1






active

oldest

votes


















2












$begingroup$

This is equivalent to asking if there is always $m=n+p^2$ between $p^2$ and $(p+1)^2$ with $$m equiv n+p^2 not equiv q+p^2 equiv p# equiv 0 pmod{2,3,...,p}$$
i.e. if there is always a prime $m=n+p^2$ between $p^2$ and $(p+1)^2$, which is Legendre’s conjecture restricted to the primes. Seems true, but probably an open problem.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Excellent observation!
    $endgroup$
    – rtybase
    Jan 8 at 23:06












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%2f3066800%2fcongruences-mod-p%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









2












$begingroup$

This is equivalent to asking if there is always $m=n+p^2$ between $p^2$ and $(p+1)^2$ with $$m equiv n+p^2 not equiv q+p^2 equiv p# equiv 0 pmod{2,3,...,p}$$
i.e. if there is always a prime $m=n+p^2$ between $p^2$ and $(p+1)^2$, which is Legendre’s conjecture restricted to the primes. Seems true, but probably an open problem.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Excellent observation!
    $endgroup$
    – rtybase
    Jan 8 at 23:06
















2












$begingroup$

This is equivalent to asking if there is always $m=n+p^2$ between $p^2$ and $(p+1)^2$ with $$m equiv n+p^2 not equiv q+p^2 equiv p# equiv 0 pmod{2,3,...,p}$$
i.e. if there is always a prime $m=n+p^2$ between $p^2$ and $(p+1)^2$, which is Legendre’s conjecture restricted to the primes. Seems true, but probably an open problem.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Excellent observation!
    $endgroup$
    – rtybase
    Jan 8 at 23:06














2












2








2





$begingroup$

This is equivalent to asking if there is always $m=n+p^2$ between $p^2$ and $(p+1)^2$ with $$m equiv n+p^2 not equiv q+p^2 equiv p# equiv 0 pmod{2,3,...,p}$$
i.e. if there is always a prime $m=n+p^2$ between $p^2$ and $(p+1)^2$, which is Legendre’s conjecture restricted to the primes. Seems true, but probably an open problem.






share|cite|improve this answer











$endgroup$



This is equivalent to asking if there is always $m=n+p^2$ between $p^2$ and $(p+1)^2$ with $$m equiv n+p^2 not equiv q+p^2 equiv p# equiv 0 pmod{2,3,...,p}$$
i.e. if there is always a prime $m=n+p^2$ between $p^2$ and $(p+1)^2$, which is Legendre’s conjecture restricted to the primes. Seems true, but probably an open problem.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Jan 8 at 23:06









rtybase

11.5k31534




11.5k31534










answered Jan 8 at 22:47









user632936user632936

362




362












  • $begingroup$
    Excellent observation!
    $endgroup$
    – rtybase
    Jan 8 at 23:06


















  • $begingroup$
    Excellent observation!
    $endgroup$
    – rtybase
    Jan 8 at 23:06
















$begingroup$
Excellent observation!
$endgroup$
– rtybase
Jan 8 at 23:06




$begingroup$
Excellent observation!
$endgroup$
– rtybase
Jan 8 at 23:06


















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%2f3066800%2fcongruences-mod-p%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

Bressuire

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
Read more

Cabo Verde

Image
  Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º) ...
Read more

Gyllenstierna

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
Read more