Sum of divisor powers: Inequalities (formula 13.05.29.0011)

DivisorSigma

$Mathematica Notation$

Number Theory Functions

DivisorSigma[k,n]

Inequalities

http://functions.wolfram.com/13.05.29.0011.01

Input Form

DivisorSigma[0, n] > n/EulerPhi[n] /; n >= 3

Standard Form

Cell[BoxData[RowBox[List[RowBox[List[RowBox[List["DivisorSigma", "[", RowBox[List["0", ",", "n"]], "]"]], ">", FractionBox["n", RowBox[List["EulerPhi", "[", "n", "]"]]]]], "/;", RowBox[List["n", "\[GreaterEqual]", "3"]]]]]]

MathML Form

<math xmlns='http://www.w3.org/1998/Math/MathML' mathematica:form='TraditionalForm' xmlns:mathematica='http://www.wolfram.com/XML/'> <semantics> <mrow> <mrow> <mrow> <msub> <semantics> <mi> σ </mi> <annotation encoding='Mathematica'> TagBox["\[Sigma]", DivisorSigma] </annotation> </semantics> <mn> 0 </mn> </msub> <mo> ( </mo> <mi> n </mi> <mo> ) </mo> </mrow> <mo> > </mo> <mfrac> <mi> n </mi> <mrow> <semantics> <mi> ϕ </mi> <annotation encoding='Mathematica'> TagBox["\[Phi]", EulerPhi] </annotation> </semantics> <mo> ( </mo> <mi> n </mi> <mo> ) </mo> </mrow> </mfrac> </mrow> <mo> /; </mo> <mrow> <mi> n </mi> <mo> ≥ </mo> <mn> 3 </mn> </mrow> </mrow> <annotation-xml encoding='MathML-Content'> <apply> <ci> Condition </ci> <apply> <gt /> <apply> <ci> DivisorSigma </ci> <cn type='integer'> 0 </cn> <ci> n </ci> </apply> <apply> <times /> <ci> n </ci> <apply> <power /> <apply> <ci> EulerPhi </ci> <ci> n </ci> </apply> <cn type='integer'> -1 </cn> </apply> </apply> </apply> <apply> <geq /> <ci> n </ci> <cn type='integer'> 3 </cn> </apply> </apply> </annotation-xml> </semantics> </math>

Rule Form

Date Added to functions.wolfram.com (modification date)

2002-12-18