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 could Tony Stark make this in Endgame?

Can not tell colimits from limits

Are Boeing 737-800’s grounded?

Mac Pro install disk keeps ejecting itself

Do vanished people know what happened after the snap?

How much cash can I safely carry into the USA and avoid civil forfeiture?

Why does nature favour the Laplacian?

A ​Note ​on ​N!

Is DC-to-DC (24 V to 12 V) buck conversion typically more efficient than AC-to-DC (110 V to 12 V) conversion?

Phrase for the opposite of "foolproof"

Providence Pentominoes Puzzle By Andrew Bradburn (Jigsaw)

Killing undead fish underwater

What is the difference between `a[bc]d` (brackets) and `ab,cd` (braces)?

Question relating to a number theoretic function

Was it really necessary for the Lunar module LM to have 2 stages?

Will this character get back his Infinity Stone?

Does the UK provide 50% of EU's waters? And does this imply anything about fishing rights?

How exactly does Hawking radiation decrease the mass of black holes?

How to figure out whether the data is sample data or population data apart from the client's information?

Confused by chemical notation

How do Bards prepare spells?

Binary Numbers Magic Trick

Error message with tabularx

How to back up a running remote server?



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
    2 hours ago











  • $begingroup$
    That conjecture is overkill, I "believe" my question is simpler.
    $endgroup$
    – acreativename
    2 hours ago






  • 1




    $begingroup$
    Yes, of course, it was only a comment.
    $endgroup$
    – ajotatxe
    2 hours ago










  • $begingroup$
    no worries all good here
    $endgroup$
    – acreativename
    2 hours 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
    2 hours ago











  • $begingroup$
    That conjecture is overkill, I "believe" my question is simpler.
    $endgroup$
    – acreativename
    2 hours ago






  • 1




    $begingroup$
    Yes, of course, it was only a comment.
    $endgroup$
    – ajotatxe
    2 hours ago










  • $begingroup$
    no worries all good here
    $endgroup$
    – acreativename
    2 hours 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
    2 hours ago











  • $begingroup$
    That conjecture is overkill, I "believe" my question is simpler.
    $endgroup$
    – acreativename
    2 hours ago






  • 1




    $begingroup$
    Yes, of course, it was only a comment.
    $endgroup$
    – ajotatxe
    2 hours ago










  • $begingroup$
    no worries all good here
    $endgroup$
    – acreativename
    2 hours 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
    2 hours ago











  • $begingroup$
    That conjecture is overkill, I "believe" my question is simpler.
    $endgroup$
    – acreativename
    2 hours ago






  • 1




    $begingroup$
    Yes, of course, it was only a comment.
    $endgroup$
    – ajotatxe
    2 hours ago










  • $begingroup$
    no worries all good here
    $endgroup$
    – acreativename
    2 hours 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
2 hours 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
2 hours ago













$begingroup$
That conjecture is overkill, I "believe" my question is simpler.
$endgroup$
– acreativename
2 hours ago




$begingroup$
That conjecture is overkill, I "believe" my question is simpler.
$endgroup$
– acreativename
2 hours ago




1




1




$begingroup$
Yes, of course, it was only a comment.
$endgroup$
– ajotatxe
2 hours ago




$begingroup$
Yes, of course, it was only a comment.
$endgroup$
– ajotatxe
2 hours ago












$begingroup$
no worries all good here
$endgroup$
– acreativename
2 hours ago




$begingroup$
no worries all good here
$endgroup$
– acreativename
2 hours 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
    2 hours 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
    2 hours 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
    2 hours 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 2 hours ago









ajotatxeajotatxe

54.6k24090




54.6k24090











  • $begingroup$
    Yup that solves the problem thanks.
    $endgroup$
    – acreativename
    2 hours 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
    2 hours 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
2 hours ago




$begingroup$
Yup that solves the problem thanks.
$endgroup$
– acreativename
2 hours 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

Can not update quote_id field of “quote_item” table magento 2Magento 2.1 - We can't remove the item. (Shopping Cart doesnt allow us to remove items before becomes empty)Add value for custom quote item attribute using REST apiREST API endpoint v1/carts/cartId/items always returns error messageCorrect way to save entries to databaseHow to remove all associated quote objects of a customer completelyMagento 2 - Save value from custom input field to quote_itemGet quote_item data using quote id and product id filter in Magento 2How to set additional data to quote_item table from controller in Magento 2?What is the purpose of additional_data column in quote_item table in magento2Set Custom Price to Quote item magento2 from controller

How to solve knockout JS error in Magento 2 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?(Magento2) knockout.js:3012 Uncaught ReferenceError: Unable to process bindingUnable to process binding Knockout.js magento 2Cannot read property `scopeLabel` of undefined on Product Detail PageCan't get Customer Data on frontend in Magento 2Magento2 Order Summary - unable to process bindingKO templates are not loading in Magento 2.1 applicationgetting knockout js error magento 2Product grid not load -— Unable to process binding Knockout.js magento 2Product form not loaded in magento2Uncaught ReferenceError: Unable to process binding “if: function()return (isShowLegend()) ” magento 2

Nissan Patrol Зміст Перше покоління — 4W60 (1951-1960) | Друге покоління — 60 series (1960-1980) | Третє покоління (1980–2002) | Четверте покоління — Y60 (1987–1998) | П'яте покоління — Y61 (1997–2013) | Шосте покоління — Y62 (2010- ) | Посилання | Зноски | Навігаційне менюОфіційний український сайтТест-драйв Nissan Patrol 2010 7-го поколінняNissan PatrolКак мы тестировали Nissan Patrol 2016рвиправивши або дописавши її