Second Chebyshev function and Unique prime factorization
Clash 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.
number-theory
add a comment |Â
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.
number-theory
add a comment |Â
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.
number-theory
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.
number-theory
edited Aug 15 at 16:50
asked Aug 7 at 19:42
Adam
31411
31411
add a comment |Â
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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
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
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
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
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