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

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













2












$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.










share|cite|improve this question









$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















2












$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.










share|cite|improve this question









$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













2












2








2


1



$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.










share|cite|improve this question









$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






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










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
















  • $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










1 Answer
1






active

oldest

votes


















4












$begingroup$

Hint:



For every $age 2$,
$$M(2a)=M(a)$$






share|cite|improve this answer









$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











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
);



);













draft saved

draft discarded


















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









4












$begingroup$

Hint:



For every $age 2$,
$$M(2a)=M(a)$$






share|cite|improve this answer









$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















4












$begingroup$

Hint:



For every $age 2$,
$$M(2a)=M(a)$$






share|cite|improve this answer









$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













4












4








4





$begingroup$

Hint:



For every $age 2$,
$$M(2a)=M(a)$$






share|cite|improve this answer









$endgroup$



Hint:



For every $age 2$,
$$M(2a)=M(a)$$







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










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
















  • $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

















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%2f3205369%2fquestion-relating-to-a-number-theoretic-function%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

Are there any AGPL-style licences that require source code modifications to be public? Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Force derivative works to be publicAre there any GPL like licenses for Apple App Store?Do you violate the GPL if you provide source code that cannot be compiled?GPL - is it distribution to use libraries in an appliance loaned to customers?Distributing App for free which uses GPL'ed codeModifications of server software under GPL, with web/CLI interfaceDoes using an AGPLv3-licensed library prevent me from dual-licensing my own source code?Can I publish only select code under GPLv3 from a private project?Is there published precedent regarding the scope of covered work that uses AGPL software?If MIT licensed code links to GPL licensed code what should be the license of the resulting binary program?If I use a public API endpoint that has its source code licensed under AGPL in my app, do I need to disclose my source?

2013 GY136 Descoberta | Órbita | Referências Menu de navegação«List Of Centaurs and Scattered-Disk Objects»«List of Known Trans-Neptunian Objects»

Mortes em março de 2019 Referências Menu de navegação«Zhores Alferov, Nobel de Física bielorrusso, morre aos 88 anos - Ciência»«Fallece Rafael Torija, o bispo emérito de Ciudad Real»«Peter Hurford dies at 88»«Keith Flint, vocalista do The Prodigy, morre aos 49 anos»«Luke Perry, ator de 'Barrados no baile' e 'Riverdale', morre aos 52 anos»«Former Rangers and Scotland captain Eric Caldow dies, aged 84»«Morreu, aos 61 anos, a antiga lenda do wrestling King Kong Bundy»«Fallece el actor y director teatral Abraham Stavans»«In Memoriam Guillaume Faye»«Sidney Sheinberg, a Force Behind Universal and Spielberg, Is Dead at 84»«Carmine Persico, Colombo Crime Family Boss, Is Dead at 85»«Dirigent Michael Gielen gestorben»«Ciclista tricampeã mundial e prata na Rio 2016 é encontrada morta em casa aos 23 anos»«Pagan Community Notes: Raven Grimassi dies, Indianapolis pop-up event cancelled, Circle Sanctuary announces new podcast, and more!»«Hal Blaine, Wrecking Crew Drummer, Dies at 90»«Morre Coutinho, que editou dupla lendária com Pelé no Santos»«Cantor Demétrius, ídolo da Jovem Guarda, morre em SP»«Ex-presidente do Vasco, Eurico Miranda morre no Rio de Janeiro»«Bronze no Mundial de basquete de 1971, Laís Elena morre aos 76 anos»«Diretor de Corridas da F1, Charlie Whiting morre aos 66 anos às vésperas do GP da Austrália»«Morreu o cardeal Danneels, da Bélgica»«Morreu o cartoonista Augusto Cid»«Morreu a atriz Maria Isabel de Lizandra, de "Vale Tudo" e novelas da Tupi»«WS Merwin, prize-winning poet of nature, dies at 91»«Atriz Márcia Real morre em São Paulo aos 88 anos»«Mauritanie: décès de l'ancien président Mohamed Mahmoud ould Louly»«Morreu Dick Dale, o rei da surf guitar e de "Pulp Fiction"»«Falleció Víctor Genes»«João Carlos Marinho, autor de 'O Gênio do Crime', morre em SP»«Legendary Horror Director and SFX Artist John Carl Buechler Dies at 66»«Morre em Salvador a religiosa Makota Valdina»«مرگ بازیکن‌ سابق نساجی بر اثر سقوط سنگ در مازندران»«Domingos Oliveira morre no Rio»«Morre Airton Ravagniani, ex-São Paulo, Fla, Vasco, Grêmio e Sport - Notícias»«Morre o escritor Flavio Moreira da Costa»«Larry Cohen, Writer-Director of 'It's Alive' and 'Hell Up in Harlem,' Dies at 77»«Scott Walker, experimental singer-songwriter, dead at 76»«Joseph Pilato, Day of the Dead Star and Horror Favorite, Dies at 70»«Sheffield United set to pay tribute to legendary goalkeeper Ted Burgin who has died at 91»«Morre Rafael Henzel, sobrevivente de acidente aéreo da Chapecoense»«Morre Valery Bykovsky, um dos primeiros cosmonautas da União Soviética»«Agnès Varda, cineasta da Nouvelle Vague, morre aos 90 anos»«Agnès Varda, cineasta francesa, morre aos 90 anos»«Tania Mallet, James Bond Actress and Helen Mirren's Cousin, Dies at 77»e