A Simpler Dense Proof Regarding the Abundancy Index

@article{Ryan2003ASD,
  title={A Simpler Dense Proof Regarding the Abundancy Index},
  author={Richard F. Ryan},
  journal={Mathematics Magazine},
  year={2003},
  volume={76},
  pages={299 - 301}
}
  • R. F. Ryan
  • Published 1 October 2003
  • Philosophy, Economics
  • Mathematics Magazine
(B) If I (a) = r/s is in lowest terms, then s divides a. This follows since sa (a) = ra and gcd(r, s) = 1. (C) If I (a) = r/s is in lowest terms then r > ar(s). This follows from properties (B) and (A) since r/s = I (a) > I (s) = a(s)/s. (The condition that r and s be relatively prime is an important one! Note that 1(2) = 6/4 even though 6 r then r/s is not an abundancy index. 

The Associativity of the Symmetric Difference

The symmetric difference of two sets A and B is defined by A AB = (A \ B) U (B \ A). It is easy to verify that A is commutative. However, associativity of A is not as straightforward to establish,

Theoretical Friends of Finite Proximity

Using a definition given by Jeffrey Ward [4], we look into which positive integers have a theoretical friend of finite proximity (TFOFP). We show that 1 and odd primes do not have TFOFPs. We show

Upper Bounds on the Sum of Principal Divisors of an Integer

A prime-power is any integer of the form p", where p is a prime and a is a positive integer. Two prime-powers are independent if they are powers of different primes. The Fundamental Theorem of

Conditions Equivalent to the Existence of Odd Perfect Numbers

7. R. L. Duncan. A variation of the Buffon needle problem. this MAGAZINE, 40 (1967), 36–38. 8. H. J. Khamis. Buffon’s needle problem on radial lines. this MAGAZINE, 64 (1991), 56–58. 9. Daniel A.

Proof Without Words: Every Octagonal Number Is the Difference of Two Squares

1. B. Alspach, Group action on graph decompositions, colloquium talk at Illinois State University, Sept. 4, 2002. 2. M. Benito and J. L. Varona, Advances in aliquot sequences, Math. Comp. 68 (1999),

Solving the Odd Perfect Number Problem: Some Old and New Approaches

A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs)

On The Existence of Prime Numbers in Polynomial Sequences, And Odd Perfect Numbers

It is known that certain polynomials of degree one, with integer coefficients, admit infinitely-many primes. In this thesis, we provide an alternative proof of Dirichlets theorem concerning primes in

References

SHOWING 1-7 OF 7 REFERENCES

The Abundancy Ratio, a Measure of Perfection

Acknowledgment. I am indebted to Hessel Pot from Woerden in the Netherlands who in a personal communication to me in 1997 pointed out the additional properties to Theorems 1 and 2, as well as Theorem

Measuring the Abundancy of Integers

The origins of the study of perfect numbers are lost in antiquity, but the concept was clearly recognized well over 2000 years ago and involves such contributors as Euclid, Fermat, Descartes,

Improved techniques for lower bounds for odd perfect numbers

TLDR
It is proved here that, subject to certain conditions verifiable in polynomial time, in fact N > q5k/2, and the computations in an earlier paper are extended to show that N > 10300.

An Introduction to the Theory of Numbers

  • E. T.
  • Mathematics
    Nature
  • 1946
THIS book must be welcomed most warmly into X the select class of Oxford books on pure mathematics which have reached a second edition. It obviously appeals to a large class of mathematical readers.

Measuring the abundancy of integers, this MAGAZINE

  • 1986

and E

  • M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Pr., New York,
  • 1979

Results concerning uniqueness for σ(x)/x = σ(pnqm )/(pnqm ) and related topics

  • Int. Math. J
  • 2002