An Explicit Bound for Aliquot Cycles of Repdigits

Articles in the same Issue

1. Masthead
2. On Weakly Complete Sequences Formed by the Greedy Algorithm
3. Bijective Proofs of Vajda's Ninetieth Fibonacci Number Identity and Related Identities
4. Newman Polynomials, Reducibility, and Roots on the Unit Circle
5. A Property of Twin Primes
6. Number of Permutations with Prescribed Up-Down Structure as a Function of Two Variables
7. A -Expansion Associated to Sturmian Sequences
8. On the Number of Carries Occurring in an Addition Mod 
9. A Probabilistic Look at Series Involving Euler's Totient Function
10. Fibonacci Variations of a Conjecture of Polignac
11. Extending Nathanson Heights to Arbitrary Finite Fields
12. On the Maximal Cross Number of Unique Factorization Zero-Sum Sequences over a Finite Abelian Group
13. An Explicit Bound for Aliquot Cycles of Repdigits
14. A Note on the Minimal Number of Representations in 
15. A Unified Proof of Two Classical Theorems on CNS Polynomials
16. On the Problem of Molluzzo for the Modulus 4
17. On Multiplicative Functions with Bounded Partial Sums
18. Avoiding Type or Patterns in a Partition of a Set