On some properties of the Euler's factor of certain odd perfect numbers (Q818072): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114157596, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sketch of a Proof that an Odd Perfect Number Relatively Prime to 3 has at Least Eleven Prime Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Perfect Numbers Not Divisible by 3. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4049142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Euler's factor of an odd perfect number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd perfect numbers: a divisor related to the Euler's factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3375879 / rank
 
Normal rank

Latest revision as of 11:27, 24 June 2024

scientific article
Language Label Description Also known as
English
On some properties of the Euler's factor of certain odd perfect numbers
scientific article

    Statements

    On some properties of the Euler's factor of certain odd perfect numbers (English)
    0 references
    0 references
    24 March 2006
    0 references
    Let \(\sigma(n)\) be the sum of the positive divisors of the natural number \(n\); \(n\) is said to be perfect if \(\sigma(n)=2n\). It is shown that if an odd perfect integer \(n\) is of the form \(p^a(3Q)^{2b}\) with \(p\), \(a\), \(Q\) and \(b\) satisfying certain restrictions, then \(\sigma(p^a)\equiv 0 \pmod {3^{2b}}\). The proof is elementary.
    0 references
    0 references
    odd perfect numbers
    0 references

    Identifiers