Second Chebyshev function and Unique prime factorization

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












the identity for the second Chebyshev function:
$$sum _j=1^pi left( x right) Biggllfloor frac ln
left( x right) ln left( p_j right) Biggrrfloor ln
left( p_j right)=ln(operatornamelcm(1,2,3,...,lfloor x rfloor))quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(0)
$$



Any natural number $N$ has a unique prime factorization product:
$$N=p_1,N^v_1,Np_2,N^v_2,Np_3,N^v_3,Ncdotcdotcdot p_omega(N),N^v_omega(N),Nquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(1)$$



Allows us to make the following assertion about the natural logarithm of any such natural:
$$ln left( N right) =sum _j=1^omega left( N right) v_j,N
ln left( p_j,N right)
quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(1')$$



My question is as to whether or not stating the above is sufficient justification for stating the following to be true:



$pi(x)=omega(operatornamelcm(1,2,3,...,lfloor xrfloor))quad quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(a)$



the largest multiplicity any factor of $operatornamelcm(1,2,3,...,lfloor xrfloor)$ may have is $ lfloorfracln left( x right) 2rfloor quadquadquadquadquadquadquad,,,(b)$



Both (a) and (b) I concluded from (0) & ('1), I just feel as if I am missing something that is necessary in a direct proof of these statements.







share|cite|improve this question

























    up vote
    1
    down vote

    favorite












    the identity for the second Chebyshev function:
    $$sum _j=1^pi left( x right) Biggllfloor frac ln
    left( x right) ln left( p_j right) Biggrrfloor ln
    left( p_j right)=ln(operatornamelcm(1,2,3,...,lfloor x rfloor))quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(0)
    $$



    Any natural number $N$ has a unique prime factorization product:
    $$N=p_1,N^v_1,Np_2,N^v_2,Np_3,N^v_3,Ncdotcdotcdot p_omega(N),N^v_omega(N),Nquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(1)$$



    Allows us to make the following assertion about the natural logarithm of any such natural:
    $$ln left( N right) =sum _j=1^omega left( N right) v_j,N
    ln left( p_j,N right)
    quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(1')$$



    My question is as to whether or not stating the above is sufficient justification for stating the following to be true:



    $pi(x)=omega(operatornamelcm(1,2,3,...,lfloor xrfloor))quad quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(a)$



    the largest multiplicity any factor of $operatornamelcm(1,2,3,...,lfloor xrfloor)$ may have is $ lfloorfracln left( x right) 2rfloor quadquadquadquadquadquadquad,,,(b)$



    Both (a) and (b) I concluded from (0) & ('1), I just feel as if I am missing something that is necessary in a direct proof of these statements.







    share|cite|improve this question























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      the identity for the second Chebyshev function:
      $$sum _j=1^pi left( x right) Biggllfloor frac ln
      left( x right) ln left( p_j right) Biggrrfloor ln
      left( p_j right)=ln(operatornamelcm(1,2,3,...,lfloor x rfloor))quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(0)
      $$



      Any natural number $N$ has a unique prime factorization product:
      $$N=p_1,N^v_1,Np_2,N^v_2,Np_3,N^v_3,Ncdotcdotcdot p_omega(N),N^v_omega(N),Nquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(1)$$



      Allows us to make the following assertion about the natural logarithm of any such natural:
      $$ln left( N right) =sum _j=1^omega left( N right) v_j,N
      ln left( p_j,N right)
      quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(1')$$



      My question is as to whether or not stating the above is sufficient justification for stating the following to be true:



      $pi(x)=omega(operatornamelcm(1,2,3,...,lfloor xrfloor))quad quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(a)$



      the largest multiplicity any factor of $operatornamelcm(1,2,3,...,lfloor xrfloor)$ may have is $ lfloorfracln left( x right) 2rfloor quadquadquadquadquadquadquad,,,(b)$



      Both (a) and (b) I concluded from (0) & ('1), I just feel as if I am missing something that is necessary in a direct proof of these statements.







      share|cite|improve this question













      the identity for the second Chebyshev function:
      $$sum _j=1^pi left( x right) Biggllfloor frac ln
      left( x right) ln left( p_j right) Biggrrfloor ln
      left( p_j right)=ln(operatornamelcm(1,2,3,...,lfloor x rfloor))quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(0)
      $$



      Any natural number $N$ has a unique prime factorization product:
      $$N=p_1,N^v_1,Np_2,N^v_2,Np_3,N^v_3,Ncdotcdotcdot p_omega(N),N^v_omega(N),Nquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(1)$$



      Allows us to make the following assertion about the natural logarithm of any such natural:
      $$ln left( N right) =sum _j=1^omega left( N right) v_j,N
      ln left( p_j,N right)
      quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(1')$$



      My question is as to whether or not stating the above is sufficient justification for stating the following to be true:



      $pi(x)=omega(operatornamelcm(1,2,3,...,lfloor xrfloor))quad quadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquadquad(a)$



      the largest multiplicity any factor of $operatornamelcm(1,2,3,...,lfloor xrfloor)$ may have is $ lfloorfracln left( x right) 2rfloor quadquadquadquadquadquadquad,,,(b)$



      Both (a) and (b) I concluded from (0) & ('1), I just feel as if I am missing something that is necessary in a direct proof of these statements.









      share|cite|improve this question












      share|cite|improve this question




      share|cite|improve this question








      edited Aug 15 at 16:50
























      asked Aug 7 at 19:42









      Adam

      31411




      31411

























          active

          oldest

          votes











          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',
          convertImagesToLinks: true,
          noModals: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          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%2f2875321%2fsecond-chebyshev-function-and-unique-prime-factorization%23new-answer', 'question_page');

          );

          Post as a guest



































          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes










           

          draft saved


          draft discarded


























           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2875321%2fsecond-chebyshev-function-and-unique-prime-factorization%23new-answer', 'question_page');

          );

          Post as a guest













































































          這個網誌中的熱門文章

          How to combine Bézier curves to a surface?

          Mutual Information Always Non-negative

          Why am i infinitely getting the same tweet with the Twitter Search API?