Probability for composite $n$ to have prime factor $geq sqrt n$












1












$begingroup$


Let $operatorname{GPF}(n)$ denote the largest prime factor of
$ninmathbb N_{>1}$. My computer tests for intervalls $[m,n]$, where $n<10,000,000$, suggests that the probability
$operatorname{P}(operatorname{GPF}(n)geqsqrt n)$ is asymptotically equivalent with a constant $approxfrac{8}{11}$.



Can this be proved, heuristically understood or falsified?










share|cite|improve this question









$endgroup$












  • $begingroup$
    The probability over what? What you are saying seems to more closely resemble the idea that the density of naturals with this property is $approx frac 8{11}$.
    $endgroup$
    – DreamConspiracy
    Dec 29 '18 at 14:56






  • 2




    $begingroup$
    The precise limit is $ln 2$. See also this.
    $endgroup$
    – metamorphy
    Dec 29 '18 at 14:57










  • $begingroup$
    @DreamConspiracy: the meaning is $lim_{ntoinfty}p_n$, where $p_n$ is the probability that a random integer $in[1,n]$ has a factor $>n^{1/2}$.
    $endgroup$
    – metamorphy
    Dec 29 '18 at 14:59












  • $begingroup$
    @metamorphy yes, that is the definition of what I said above
    $endgroup$
    – DreamConspiracy
    Dec 29 '18 at 15:00






  • 3




    $begingroup$
    See also math.stackexchange.com/questions/375270/…
    $endgroup$
    – lhf
    Dec 29 '18 at 16:46
















1












$begingroup$


Let $operatorname{GPF}(n)$ denote the largest prime factor of
$ninmathbb N_{>1}$. My computer tests for intervalls $[m,n]$, where $n<10,000,000$, suggests that the probability
$operatorname{P}(operatorname{GPF}(n)geqsqrt n)$ is asymptotically equivalent with a constant $approxfrac{8}{11}$.



Can this be proved, heuristically understood or falsified?










share|cite|improve this question









$endgroup$












  • $begingroup$
    The probability over what? What you are saying seems to more closely resemble the idea that the density of naturals with this property is $approx frac 8{11}$.
    $endgroup$
    – DreamConspiracy
    Dec 29 '18 at 14:56






  • 2




    $begingroup$
    The precise limit is $ln 2$. See also this.
    $endgroup$
    – metamorphy
    Dec 29 '18 at 14:57










  • $begingroup$
    @DreamConspiracy: the meaning is $lim_{ntoinfty}p_n$, where $p_n$ is the probability that a random integer $in[1,n]$ has a factor $>n^{1/2}$.
    $endgroup$
    – metamorphy
    Dec 29 '18 at 14:59












  • $begingroup$
    @metamorphy yes, that is the definition of what I said above
    $endgroup$
    – DreamConspiracy
    Dec 29 '18 at 15:00






  • 3




    $begingroup$
    See also math.stackexchange.com/questions/375270/…
    $endgroup$
    – lhf
    Dec 29 '18 at 16:46














1












1








1





$begingroup$


Let $operatorname{GPF}(n)$ denote the largest prime factor of
$ninmathbb N_{>1}$. My computer tests for intervalls $[m,n]$, where $n<10,000,000$, suggests that the probability
$operatorname{P}(operatorname{GPF}(n)geqsqrt n)$ is asymptotically equivalent with a constant $approxfrac{8}{11}$.



Can this be proved, heuristically understood or falsified?










share|cite|improve this question









$endgroup$




Let $operatorname{GPF}(n)$ denote the largest prime factor of
$ninmathbb N_{>1}$. My computer tests for intervalls $[m,n]$, where $n<10,000,000$, suggests that the probability
$operatorname{P}(operatorname{GPF}(n)geqsqrt n)$ is asymptotically equivalent with a constant $approxfrac{8}{11}$.



Can this be proved, heuristically understood or falsified?







probability divisibility prime-factorization conjectures






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 29 '18 at 14:46









LehsLehs

7,02931664




7,02931664












  • $begingroup$
    The probability over what? What you are saying seems to more closely resemble the idea that the density of naturals with this property is $approx frac 8{11}$.
    $endgroup$
    – DreamConspiracy
    Dec 29 '18 at 14:56






  • 2




    $begingroup$
    The precise limit is $ln 2$. See also this.
    $endgroup$
    – metamorphy
    Dec 29 '18 at 14:57










  • $begingroup$
    @DreamConspiracy: the meaning is $lim_{ntoinfty}p_n$, where $p_n$ is the probability that a random integer $in[1,n]$ has a factor $>n^{1/2}$.
    $endgroup$
    – metamorphy
    Dec 29 '18 at 14:59












  • $begingroup$
    @metamorphy yes, that is the definition of what I said above
    $endgroup$
    – DreamConspiracy
    Dec 29 '18 at 15:00






  • 3




    $begingroup$
    See also math.stackexchange.com/questions/375270/…
    $endgroup$
    – lhf
    Dec 29 '18 at 16:46


















  • $begingroup$
    The probability over what? What you are saying seems to more closely resemble the idea that the density of naturals with this property is $approx frac 8{11}$.
    $endgroup$
    – DreamConspiracy
    Dec 29 '18 at 14:56






  • 2




    $begingroup$
    The precise limit is $ln 2$. See also this.
    $endgroup$
    – metamorphy
    Dec 29 '18 at 14:57










  • $begingroup$
    @DreamConspiracy: the meaning is $lim_{ntoinfty}p_n$, where $p_n$ is the probability that a random integer $in[1,n]$ has a factor $>n^{1/2}$.
    $endgroup$
    – metamorphy
    Dec 29 '18 at 14:59












  • $begingroup$
    @metamorphy yes, that is the definition of what I said above
    $endgroup$
    – DreamConspiracy
    Dec 29 '18 at 15:00






  • 3




    $begingroup$
    See also math.stackexchange.com/questions/375270/…
    $endgroup$
    – lhf
    Dec 29 '18 at 16:46
















$begingroup$
The probability over what? What you are saying seems to more closely resemble the idea that the density of naturals with this property is $approx frac 8{11}$.
$endgroup$
– DreamConspiracy
Dec 29 '18 at 14:56




$begingroup$
The probability over what? What you are saying seems to more closely resemble the idea that the density of naturals with this property is $approx frac 8{11}$.
$endgroup$
– DreamConspiracy
Dec 29 '18 at 14:56




2




2




$begingroup$
The precise limit is $ln 2$. See also this.
$endgroup$
– metamorphy
Dec 29 '18 at 14:57




$begingroup$
The precise limit is $ln 2$. See also this.
$endgroup$
– metamorphy
Dec 29 '18 at 14:57












$begingroup$
@DreamConspiracy: the meaning is $lim_{ntoinfty}p_n$, where $p_n$ is the probability that a random integer $in[1,n]$ has a factor $>n^{1/2}$.
$endgroup$
– metamorphy
Dec 29 '18 at 14:59






$begingroup$
@DreamConspiracy: the meaning is $lim_{ntoinfty}p_n$, where $p_n$ is the probability that a random integer $in[1,n]$ has a factor $>n^{1/2}$.
$endgroup$
– metamorphy
Dec 29 '18 at 14:59














$begingroup$
@metamorphy yes, that is the definition of what I said above
$endgroup$
– DreamConspiracy
Dec 29 '18 at 15:00




$begingroup$
@metamorphy yes, that is the definition of what I said above
$endgroup$
– DreamConspiracy
Dec 29 '18 at 15:00




3




3




$begingroup$
See also math.stackexchange.com/questions/375270/…
$endgroup$
– lhf
Dec 29 '18 at 16:46




$begingroup$
See also math.stackexchange.com/questions/375270/…
$endgroup$
– lhf
Dec 29 '18 at 16:46










1 Answer
1






active

oldest

votes


















2












$begingroup$

Begin by noting that if a natural $n$ has a prime factor $p geq sqrt{n}$, then clearly $p$ is unique for $n$. So let's fix some prime $p$ and consider all naturals for which $p$ satisfies this property. Clearly, these are just all naturals of the form $ap$, where $ain Bbb N, a leq p$. From this, we get that if we fix some natural $N$, then the number of naturals less than $N$ satisfying this property is precisely
$$sum_{p in Bbb P, p leq sqrt{N}}p + sum_{p in Bbb P, sqrt{N} < p leq N}lfloor frac np rfloor$$
where $Bbb P$ is of course the set of primes.






share|cite|improve this answer









$endgroup$













    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%2f3055907%2fprobability-for-composite-n-to-have-prime-factor-geq-sqrt-n%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$

    Begin by noting that if a natural $n$ has a prime factor $p geq sqrt{n}$, then clearly $p$ is unique for $n$. So let's fix some prime $p$ and consider all naturals for which $p$ satisfies this property. Clearly, these are just all naturals of the form $ap$, where $ain Bbb N, a leq p$. From this, we get that if we fix some natural $N$, then the number of naturals less than $N$ satisfying this property is precisely
    $$sum_{p in Bbb P, p leq sqrt{N}}p + sum_{p in Bbb P, sqrt{N} < p leq N}lfloor frac np rfloor$$
    where $Bbb P$ is of course the set of primes.






    share|cite|improve this answer









    $endgroup$


















      2












      $begingroup$

      Begin by noting that if a natural $n$ has a prime factor $p geq sqrt{n}$, then clearly $p$ is unique for $n$. So let's fix some prime $p$ and consider all naturals for which $p$ satisfies this property. Clearly, these are just all naturals of the form $ap$, where $ain Bbb N, a leq p$. From this, we get that if we fix some natural $N$, then the number of naturals less than $N$ satisfying this property is precisely
      $$sum_{p in Bbb P, p leq sqrt{N}}p + sum_{p in Bbb P, sqrt{N} < p leq N}lfloor frac np rfloor$$
      where $Bbb P$ is of course the set of primes.






      share|cite|improve this answer









      $endgroup$
















        2












        2








        2





        $begingroup$

        Begin by noting that if a natural $n$ has a prime factor $p geq sqrt{n}$, then clearly $p$ is unique for $n$. So let's fix some prime $p$ and consider all naturals for which $p$ satisfies this property. Clearly, these are just all naturals of the form $ap$, where $ain Bbb N, a leq p$. From this, we get that if we fix some natural $N$, then the number of naturals less than $N$ satisfying this property is precisely
        $$sum_{p in Bbb P, p leq sqrt{N}}p + sum_{p in Bbb P, sqrt{N} < p leq N}lfloor frac np rfloor$$
        where $Bbb P$ is of course the set of primes.






        share|cite|improve this answer









        $endgroup$



        Begin by noting that if a natural $n$ has a prime factor $p geq sqrt{n}$, then clearly $p$ is unique for $n$. So let's fix some prime $p$ and consider all naturals for which $p$ satisfies this property. Clearly, these are just all naturals of the form $ap$, where $ain Bbb N, a leq p$. From this, we get that if we fix some natural $N$, then the number of naturals less than $N$ satisfying this property is precisely
        $$sum_{p in Bbb P, p leq sqrt{N}}p + sum_{p in Bbb P, sqrt{N} < p leq N}lfloor frac np rfloor$$
        where $Bbb P$ is of course the set of primes.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 29 '18 at 16:45









        DreamConspiracyDreamConspiracy

        9391216




        9391216






























            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%2f3055907%2fprobability-for-composite-n-to-have-prime-factor-geq-sqrt-n%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

            Index of /

            Tribalistas

            Listed building