Question relating to a number theoretic functioninfinitely many primes p which are not congruent to $-1$ modulo $19$.A question on elementary number theoryThe largest number to break a conjectureUse this sequence to prove that there are infinitely many prime numbers.Any Heuristic Argument that for the distribution of primes $p$, about half of the primes $p$, $u(2$) $=$ $3$ prime chain?Consecutive rising sequence of largest prime factorsA question about algebraic normal numberNumber theoretic olympiad question involving a diophantine equationProve the following number theoretic assertion.A high school Olympiad problem
Multi tool use
how to interpret this t result?
Hilbert Space and Banach Space
How could Tony Stark make this in Endgame?
How do we know that ממחרת השבת means from the first day of pesach and not the seventh?
How exactly does Hawking radiation decrease the mass of black holes?
Why we can't write in air?
Inner for loop when run in background in bash spawns new bash process
A possible fake AI on Patreon!
How does a DHCP relay router forward the packet to the server?
Why the difference in metal between 銀行 and お金?
Is there really no use for MD5 anymore?
Error message with tabularx
Confused by chemical notation
Was it really necessary for the Lunar module LM to have 2 stages?
Do I have to worry about players making “bad” choices on level up?
Unexpected email from Yorkshire Bank
Packing rectangles: Does rotation ever help?
A Note on N!
Will this character get back his Infinity Stone?
Can solid acids and bases have pH values? If not, how are they classified as acids or bases?
Who is the Umpire in this picture?
Please, smoke with good manners
Fizzy, soft, pop and still drinks
Any examples of headwear for races with animal ears?
Question relating to a number theoretic function
infinitely many primes p which are not congruent to $-1$ modulo $19$.A question on elementary number theoryThe largest number to break a conjectureUse this sequence to prove that there are infinitely many prime numbers.Any Heuristic Argument that for the distribution of primes $p$, about half of the primes $p$, $u(2$) $=$ $3$ prime chain?Consecutive rising sequence of largest prime factorsA question about algebraic normal numberNumber theoretic olympiad question involving a diophantine equationProve the following number theoretic assertion.A high school Olympiad problem
$begingroup$
Question; For $a geq 2$, Let $M(a) = $ the largest prime factor of $a$ i.e $M(6) = 3, M(9) = 3, M(69) = 23$ are there infinitely many $n$ so that
$M(n-2) < M(n) < M(n+2)$ ?
One can show that for infinitely many $k$ we have $M(k-1) < M(k) < M(k+1)$ by considering the following lemma;
Lemma; If $M(y) > M(y-1),$ $exists b in mathbbN cup 0$ so that $M(y^2^b - 1) < M(y^2^b) < M(y^2^b +1)$
Proof of Lemma; If one has $M(y-1) < M(y) < M(y+1)$ then we are done, if not then we have $M(y^2-1) < M(y^2)$, If one has $M(y^2-1) < M(y^2) < M(y^2+1)$ then we are done if not then...
If the sequence of writing above ever terminates then we have the lemma; if not then one has that $forall b$ $M(y^2^b) > M(y^2^b+1)$, i.e
$forall b$ $M(y) > M(y^2^b+1)$; this is absurd (I will let you think about why).
I don't think the question above can rely on this trickery.
number-theory elementary-number-theory
asked 2 hours ago
acreativenameacreativename
14718
$endgroup$
add a comment |
$begingroup$
Question; For $a geq 2$, Let $M(a) = $ the largest prime factor of $a$ i.e $M(6) = 3, M(9) = 3, M(69) = 23$ are there infinitely many $n$ so that
$M(n-2) < M(n) < M(n+2)$ ?
One can show that for infinitely many $k$ we have $M(k-1) < M(k) < M(k+1)$ by considering the following lemma;
Lemma; If $M(y) > M(y-1),$ $exists b in mathbbN cup 0$ so that $M(y^2^b - 1) < M(y^2^b) < M(y^2^b +1)$
Proof of Lemma; If one has $M(y-1) < M(y) < M(y+1)$ then we are done, if not then we have $M(y^2-1) < M(y^2)$, If one has $M(y^2-1) < M(y^2) < M(y^2+1)$ then we are done if not then...
If the sequence of writing above ever terminates then we have the lemma; if not then one has that $forall b$ $M(y^2^b) > M(y^2^b+1)$, i.e
$forall b$ $M(y) > M(y^2^b+1)$; this is absurd (I will let you think about why).
I don't think the question above can rely on this trickery.
number-theory elementary-number-theory
asked 2 hours ago
acreativenameacreativename
14718
$endgroup$
$begingroup$
Twin primes' conjecture implies this: if $p$ and $p+2$ are prime then $M(p-2)<M(p)<M(p+2)$.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
That conjecture is overkill, I "believe" my question is simpler.
$endgroup$
– acreativename
1 hour ago
1
$begingroup$
Yes, of course, it was only a comment.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
no worries all good here
$endgroup$
– acreativename
1 hour ago
add a comment |
$begingroup$
Question; For $a geq 2$, Let $M(a) = $ the largest prime factor of $a$ i.e $M(6) = 3, M(9) = 3, M(69) = 23$ are there infinitely many $n$ so that
$M(n-2) < M(n) < M(n+2)$ ?
One can show that for infinitely many $k$ we have $M(k-1) < M(k) < M(k+1)$ by considering the following lemma;
Lemma; If $M(y) > M(y-1),$ $exists b in mathbbN cup 0$ so that $M(y^2^b - 1) < M(y^2^b) < M(y^2^b +1)$
Proof of Lemma; If one has $M(y-1) < M(y) < M(y+1)$ then we are done, if not then we have $M(y^2-1) < M(y^2)$, If one has $M(y^2-1) < M(y^2) < M(y^2+1)$ then we are done if not then...
If the sequence of writing above ever terminates then we have the lemma; if not then one has that $forall b$ $M(y^2^b) > M(y^2^b+1)$, i.e
$forall b$ $M(y) > M(y^2^b+1)$; this is absurd (I will let you think about why).
I don't think the question above can rely on this trickery.
number-theory elementary-number-theory
asked 2 hours ago
acreativenameacreativename
14718
$endgroup$
Question; For $a geq 2$, Let $M(a) = $ the largest prime factor of $a$ i.e $M(6) = 3, M(9) = 3, M(69) = 23$ are there infinitely many $n$ so that
$M(n-2) < M(n) < M(n+2)$ ?
One can show that for infinitely many $k$ we have $M(k-1) < M(k) < M(k+1)$ by considering the following lemma;
Lemma; If $M(y) > M(y-1),$ $exists b in mathbbN cup 0$ so that $M(y^2^b - 1) < M(y^2^b) < M(y^2^b +1)$
Proof of Lemma; If one has $M(y-1) < M(y) < M(y+1)$ then we are done, if not then we have $M(y^2-1) < M(y^2)$, If one has $M(y^2-1) < M(y^2) < M(y^2+1)$ then we are done if not then...
If the sequence of writing above ever terminates then we have the lemma; if not then one has that $forall b$ $M(y^2^b) > M(y^2^b+1)$, i.e
$forall b$ $M(y) > M(y^2^b+1)$; this is absurd (I will let you think about why).
I don't think the question above can rely on this trickery.
number-theory elementary-number-theory
number-theory elementary-number-theory
asked 2 hours ago
acreativenameacreativename
14718
asked 2 hours ago
acreativenameacreativename
14718
asked 2 hours ago
acreativenameacreativename
14718
asked 2 hours ago
acreativenameacreativename
14718
asked 2 hours ago
acreativenameacreativename
14718
14718
$begingroup$
Twin primes' conjecture implies this: if $p$ and $p+2$ are prime then $M(p-2)<M(p)<M(p+2)$.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
That conjecture is overkill, I "believe" my question is simpler.
$endgroup$
– acreativename
1 hour ago
1
$begingroup$
Yes, of course, it was only a comment.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
no worries all good here
$endgroup$
– acreativename
1 hour ago
add a comment |
$begingroup$
Twin primes' conjecture implies this: if $p$ and $p+2$ are prime then $M(p-2)<M(p)<M(p+2)$.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
That conjecture is overkill, I "believe" my question is simpler.
$endgroup$
– acreativename
1 hour ago
1
$begingroup$
Yes, of course, it was only a comment.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
no worries all good here
$endgroup$
– acreativename
1 hour ago
$begingroup$
Twin primes' conjecture implies this: if $p$ and $p+2$ are prime then $M(p-2)<M(p)<M(p+2)$.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
Twin primes' conjecture implies this: if $p$ and $p+2$ are prime then $M(p-2)<M(p)<M(p+2)$.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
That conjecture is overkill, I "believe" my question is simpler.
$endgroup$
– acreativename
1 hour ago
$begingroup$
That conjecture is overkill, I "believe" my question is simpler.
$endgroup$
– acreativename
1 hour ago
1
1
$begingroup$
Yes, of course, it was only a comment.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
Yes, of course, it was only a comment.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
no worries all good here
$endgroup$
– acreativename
1 hour ago
$begingroup$
no worries all good here
$endgroup$
– acreativename
1 hour ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Hint:
For every $age 2$,
$$M(2a)=M(a)$$
answered 1 hour ago
ajotatxeajotatxe
54.6k24090
$endgroup$
$begingroup$
Yup that solves the problem thanks.
$endgroup$
– acreativename
1 hour ago
$begingroup$
BTW, this idea proves also $M(n-k)<M(n)<M(n+k)$ when $k$ is a power of two or three.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
It can be extended to be proven for all $k geq 1$
$endgroup$
– acreativename
1 hour ago
add a comment |
Your Answer
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
);
);
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
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3205369%2fquestion-relating-to-a-number-theoretic-function%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
$begingroup$
Hint:
For every $age 2$,
$$M(2a)=M(a)$$
answered 1 hour ago
ajotatxeajotatxe
54.6k24090
$endgroup$
$begingroup$
Yup that solves the problem thanks.
$endgroup$
– acreativename
1 hour ago
$begingroup$
BTW, this idea proves also $M(n-k)<M(n)<M(n+k)$ when $k$ is a power of two or three.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
It can be extended to be proven for all $k geq 1$
$endgroup$
– acreativename
1 hour ago
add a comment |
$begingroup$
Hint:
For every $age 2$,
$$M(2a)=M(a)$$
answered 1 hour ago
ajotatxeajotatxe
54.6k24090
$endgroup$
$begingroup$
Yup that solves the problem thanks.
$endgroup$
– acreativename
1 hour ago
$begingroup$
BTW, this idea proves also $M(n-k)<M(n)<M(n+k)$ when $k$ is a power of two or three.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
It can be extended to be proven for all $k geq 1$
$endgroup$
– acreativename
1 hour ago
add a comment |
$begingroup$
Hint:
For every $age 2$,
$$M(2a)=M(a)$$
answered 1 hour ago
ajotatxeajotatxe
54.6k24090
$endgroup$
Hint:
For every $age 2$,
$$M(2a)=M(a)$$
answered 1 hour ago
ajotatxeajotatxe
54.6k24090
answered 1 hour ago
ajotatxeajotatxe
54.6k24090
answered 1 hour ago
ajotatxeajotatxe
54.6k24090
answered 1 hour ago
ajotatxeajotatxe
54.6k24090
54.6k24090
$begingroup$
Yup that solves the problem thanks.
$endgroup$
– acreativename
1 hour ago
$begingroup$
BTW, this idea proves also $M(n-k)<M(n)<M(n+k)$ when $k$ is a power of two or three.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
It can be extended to be proven for all $k geq 1$
$endgroup$
– acreativename
1 hour ago
add a comment |
$begingroup$
Yup that solves the problem thanks.
$endgroup$
– acreativename
1 hour ago
$begingroup$
BTW, this idea proves also $M(n-k)<M(n)<M(n+k)$ when $k$ is a power of two or three.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
It can be extended to be proven for all $k geq 1$
$endgroup$
– acreativename
1 hour ago
$begingroup$
Yup that solves the problem thanks.
$endgroup$
– acreativename
1 hour ago
$begingroup$
Yup that solves the problem thanks.
$endgroup$
– acreativename
1 hour ago
$begingroup$
BTW, this idea proves also $M(n-k)<M(n)<M(n+k)$ when $k$ is a power of two or three.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
BTW, this idea proves also $M(n-k)<M(n)<M(n+k)$ when $k$ is a power of two or three.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
It can be extended to be proven for all $k geq 1$
$endgroup$
– acreativename
1 hour ago
$begingroup$
It can be extended to be proven for all $k geq 1$
$endgroup$
– acreativename
1 hour ago
add a comment |
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.
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
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3205369%2fquestion-relating-to-a-number-theoretic-function%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
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
HwB06 QZDCk9Fh2CSoe,neqRxSUY K Qw CzSv0nqqa48A0qJ,UBIwspUjKJy9Bc 2wDSI,lyL0Ams
$begingroup$
Twin primes' conjecture implies this: if $p$ and $p+2$ are prime then $M(p-2)<M(p)<M(p+2)$.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
That conjecture is overkill, I "believe" my question is simpler.
$endgroup$
– acreativename
1 hour ago
1
$begingroup$
Yes, of course, it was only a comment.
$endgroup$
– ajotatxe
1 hour ago
$begingroup$
no worries all good here
$endgroup$
– acreativename
1 hour ago