0 Voturi pozitive0 Voturi negative

3 (de) vizualizări7 paginiA Criterion for Deficient Numbers Using the Abundancy Index and Deficiency Functions

Jun 05, 2017

© © All Rights Reserved

PDF, TXT sau citiți online pe Scribd

A Criterion for Deficient Numbers Using the Abundancy Index and Deficiency Functions

© All Rights Reserved

3 (de) vizualizări

A Criterion for Deficient Numbers Using the Abundancy Index and Deficiency Functions

© All Rights Reserved

- Historical Changes in the Concepts of Number.pdf
- norms moslehian
- SalasSV_01_03
- Sylabus (Kelas X) Rev (MHT)
- Teaching Philosophy Brainstorm
- Wohl Ou
- Logic, logic Fuzzy and Quantum
- Pengolahan Citra Digital3
- math for teaching.pdf
- Tacl Final 2
- A Brief History of Natural Deduction (Pelletier)
- English Debate
- absvalue-inequal
- Lorand Lakatos
- APPLICATIONS OF LOGIC IN MEDICINE.pdf
- Rumfitt, I. - Old Adams Buried
- Quasi Gb-closed Maps in Topological Spaces
- padlet - ccmmslions 7thperiod m7plus
- 1-s2.0-S037722171500702X-main.pdf
- Test

Sunteți pe pagina 1din 7

and Deficiency Functions

Jose Arnaldo B. Dris

Department of Mathematics and Physics, Far Eastern University

Nicanor Reyes Street, Sampaloc, Manila, Philippines

e-mail: jadris@feu.edu.ph, josearnaldobdris@gmail.com

arXiv:1308.6767v7 [math.NT] 7 Oct 2016

Abstract: We show that n is almost perfect if and only if I(n) 1 < D(n) I(n), where I(n)

is the abundancy index of n and D(n) is the deficiency of n. This criterion is then extended to

the case of integers m satisfying D(m) > 1.

Keywords: Almost perfect number, abundancy index, deficiency.

AMS Classification: 11A25.

1 Introduction

If n is a positive integer, then we write (n) for the sum of the divisors of n. A number n is

almost perfect if (n) = 2n 1. It is currently unknown whether there are any other almost

perfect numbers apart from those of the form 2k , where k 0.

(w)

We denote the abundancy index I of the positive integer w as I(w) = . We also denote

w

the deficiency D of the positive integer x as D(x) = 2x (x) [4].

2 Preliminary Lemmata

We begin with some preliminary results.

Note that I(y) = D(y) if and only if

(y) = 2y 2 y(y)

which corresponds to

2y 2 2y 2 2 2 2

(y + 1)(y) = 2y 2 (y) = = + = 2(y 1) + .

y+1 y+1 y+1 y+1

Since (y) and 2(y 1) are both integers, this implies that (y + 1) | 2, from which it follows that

y + 1 2. Hence, y 1. Together with 1 y, this means that y = 1.

We state this result as our initial lemma.

1

Lemma 2.1. I(n) = D(n) if and only if n = 1.

Next, we show conditions that are sufficient and necessary for n to be almost perfect.

2n

I(n) < 2,

n+1

then n is almost perfect.

2n

I(n) < 2.

n+1

Then we have

2n2

(n) < 2n.

n+1

But

2n2 2

= 2n 2 + (n) < 2n.

n+1 n+1

Since (n) is an integer and n 1, this last chain of inequalities forces

(n) = 2n 1,

2n

I(n) < 2.

n+1

Proof. Let n be a positive integer, and suppose that (n) = 2n 1.

It follows that

(n) 1

I(n) = = 2 < 2.

n n

Now we want to show that

2n

I(n).

n+1

2n

Assume to the contrary that I(n) < n+1 . (Note that this forces n > 1.) Mimicking the proof

in Lemma 2.2, we have

2n2

(n) < ,

n+1

from which it follows that

2

(n) < 2n 2 + < (2n 2) + 1 = 2n 1.

n+1

This contradicts our assumption that n is almost perfect. Hence the reverse inequality

2n

I(n)

n+1

holds.

2

Remark 2.1. By their definition, all almost perfect numbers are automatically deficient. But of

course, not all deficient numbers are almost perfect.

By Remark 2.1, it seems natural to try to establish an upper bound for the abundancy index of

an almost perfect number n, that is strictly less than 2, and which (perhaps) can be expressed as

a rational function of n (similar to the form of the lower bound given in Lemma 2.2 and Lemma

2.3).

Lemma 2.4. If n is a positive integer which satisfies the inequality

2n 2n + 1

I(n) < ,

n+1 n+1

then n is almost perfect.

Proof. Let n be a positive integer, and suppose that

2n 2n + 1

I(n) < .

n+1 n+1

Again, mimicking the proof in Lemma 2.2, we have

2n2 2n2 + n

(n) < ,

n+1 n+1

from which it follows that

2 1

2n 2 + (n) < 2n 1 + .

n+1 n+1

Since n 1, this last chain of inequalities forces the equation

(n) = 2n 1

to be true. Consequently, n is almost perfect, and we are done.

We now show that the (nontrivial) upper bound obtained for the abundancy index of n in

Lemma 2.4 is also necessary for n to be almost perfect.

Lemma 2.5. If n is almost perfect, then n satisfies the inequality

2n 2n + 1

I(n) < .

n+1 n+1

Proof. It suffices to prove that if n is almost perfect, then the inequality

2n + 1

I(n) <

n+1

holds. To this end, assume to the contrary that

2n + 1

I(n).

n+1

Mimicking the proof in Lemma 2.4, we obtain

1 2n2 + n

2n 1 + = (n),

n+1 n+1

from which it follows that

2n 1 < (n).

This contradicts our assumption that n is almost perfect, and we are done.

3

3 Main Results

Collecting all the results from Lemma 2.2, Lemma 2.3, Lemma 2.4 and Lemma 2.5, we now have

the following theorem.

Theorem 3.1. Let n be a positive integer. Then n is almost perfect if and only if the following

chain of inequalities hold:

2n 2n + 1

I(n) < .

n+1 n+1

Remark 3.1. Note that equality holds in

2n

I(n)

n+1

if and only if n = 1.

Also, it is trivial to verify that the known almost perfect numbers n = 2k (for integers k 0)

satisfy the inequalities in Theorem 3.1. In fact, Theorem 3.1 can be used to rule out particular

families of integers from being almost perfect numbers. (For example, n1 = pr and n2 = pr q s ,

where p, q are odd primes and r, s are even, are easily shown not to satisfy (ni ) = 2ni 1

(i = 1, 2) using the criterion in Theorem 3.1.)

This can, of course, also be attempted for the case M = 2r b2 with (M) = 2M 1, where

r 1 and b is an odd composite indivisible by 3, although a complete proof appears to be difficult

[1].

We now give a proof for the following result (which was originally conjectured in

http://arxiv.org/pdf/1308.6767v4.pdf).

2n (n) 2n + 1

I(n) = <

n+1 n n+1

are easily seen to be equivalent to

2n n (n + 1) (n) < 2n n + n

n (2n (n)) (n)

and

(n) n < (2n (n)) n

so that we obtain

I(n) 1 < 2n (n) = D(n) I(n).

Since

(n)

D(n) = 1 I(n) = < 2 = D(n) + 1

n

when n is almost perfect, we obtain the claimed result.

4

Remark 3.2. Following the proof of Theorem 3.2, and by using Lemma 2.1, we have the following

additional observations when m > 1:

2. The case I(m) < D(m) < 2 cannot occur, as it implies that 2m 2 < (m) < 2m, so

that D(m) = 2m (m) = 1, contradicting 1 I(m) < D(m) = 1.

Next, we attempt to extend the results in Theorem 3.1 to the case of positive integers m

satisfying D(m) > 1. To begin with, notice that, if we write 1 = D(n), then the bounds in

Theorem 3.1 take the following form:

2n 2n + D(n)

I(n) < .

n + D(n) n + D(n)

2n

I(n)

n + D(n)

if and only if n = 1, which is true if and only if I(n) = D(n) by Lemma 2.1.

Now, assume that m is a positive integer with D(m) > 1. We want to show that the following

theorem holds.

Theorem 3.3. Let m be a positive integer, and suppose that D(m) > 1. Then we have the

following bounds for the abundancy index of m, in terms of the deficiency of m:

2m 2m + D(m)

< I(m) < .

m + D(m) m + D(m)

Proof. Assume that m is a positive integer satisfying D(m) > 1. (In particular, note that m > 1

(by Lemma 2.1), and therefore that I(m) > 1 (since I(m) = 1 if and only if m = 1).)

Suppose to the contrary that

2m 2m

I(m) = .

m + D(m) 3m (m)

(I(m))2 3I(m) + 2 0

(I(m) 2) (I(m) 1) 0.

This is a contradiction, as we know that 1 < I(m) < 2.

5

Now, assume that

2m + D(m) 4m (m)

I(m) = .

m + D(m) 3m (m)

Then we obtain (noting that 4m (m) > 3m (m) > 2m (m) > 1)

(I(m))2 4I(m) + 4 0

(I(m) 2)2 0.

This contradicts 1 < I(m) < 2.

Consequently, we have the bounds

2m 2m + D(m)

< I(m) <

m + D(m) m + D(m)

We end this section with the following result, which closely parallels that of Theorem 3.2.

2m 2m + D(m)

< I(m) <

m + D(m) m + D(m)

are easily seen to be equivalent to

so that we obtain

1 < I(m) < 2

since D(m) > 1. Since 1 < I(m) < 2 also holds for deficient integers m satisfying D(m) > 1,

the claimed result follows.

6

4 Conclusion

The results in this article originated from the authors attempts to show that d is almost perfect, if

ef d2 is an odd perfect number with Euler prime e satisfying e f 1 (mod 4). (That is, since

2 2e

I(d) < I(d2 ) = f

,

I(e ) e+1

the author was hoping to show d < e, and thereby prove the Descartes-Frenicle-Sorli conjecture

(i.e., f = 1) as an immediate consequence.)

It is now known that, in fact, one has

2d2

I(d2 ) <

d2 + 1

and

2d

I(d) < ,

d+1

so that d2 (and therefore, d) are not almost perfect.

Additionally, Brown [3] has recently announced a proof for e < d, and a partial proof that

f

e < d holds in many cases.

Nonetheless, work is in progress in [1] to try to rule out even almost perfect numbers other

than the powers of two.

5 Acknowledgments

The author expresses his gratitude to Will Jagy for having answered his question at

http://math.stackexchange.com/q/462307 from which the proofs of Lemmas 2.2,

2.3, 2.4 and 2.5 were patterned after. The author would also like to thank John Rafael M. Antalan

from the Central Luzon State University, for helpful chat exchanges on this topic.

Lastly, the author thanks Keneth Adrian P. Dagal for motivating him to pursue the completion

of this paper.

References

[1] J. R. M. Antalan and J. A. B. Dris, Some new results on even almost perfect numbers which

are not powers of two, preprint (2016), http://arxiv.org/abs/1602.04248.

[2] J. R. M. Antalan and R. P. Tagle, Revisiting forms of almost perfect numbers, preprint (2014).

http://arxiv.org/abs/1602.01591.

http://oeis.org/A033879.

- Historical Changes in the Concepts of Number.pdfÎncărcat deΧάρης Φραντζικινάκης
- norms moslehianÎncărcat deJaber Colahi
- SalasSV_01_03Încărcat deinky13112
- Sylabus (Kelas X) Rev (MHT)Încărcat deDarsono Ono
- Teaching Philosophy BrainstormÎncărcat deLori Voss- Schoonover
- Wohl OuÎncărcat deDuilio Guerrero
- Logic, logic Fuzzy and QuantumÎncărcat deiirenka12
- Pengolahan Citra Digital3Încărcat deGanbatte Neeta
- math for teaching.pdfÎncărcat deNandang Arif Saefuloh
- Tacl Final 2Încărcat deAngel Hernandez Bravo
- A Brief History of Natural Deduction (Pelletier)Încărcat deFabio_Salgado
- English DebateÎncărcat deKartika Rosalia Indah
- absvalue-inequalÎncărcat deFred Pong
- Lorand LakatosÎncărcat dedusan.pavlovic
- APPLICATIONS OF LOGIC IN MEDICINE.pdfÎncărcat dePhuong Nguyen Le
- Rumfitt, I. - Old Adams BuriedÎncărcat defllinge
- Quasi Gb-closed Maps in Topological SpacesÎncărcat dePhilip Benj Marcoby Eragon
- padlet - ccmmslions 7thperiod m7plusÎncărcat deapi-234347533
- 1-s2.0-S037722171500702X-main.pdfÎncărcat deDyya Ellena
- TestÎncărcat deMobius
- Symbolic LogicÎncărcat deKarmaranth
- parallel_postulates_revised.pdfÎncărcat deFrederico Lopes
- Libro Base Briggs - Apéndice AÎncărcat dekNT
- 203L03S16handoutÎncărcat dewert1a2
- EssayÎncărcat deIrma Imamovic
- Linear ProgrammingÎncărcat dekurou hazama

- First Responders Guide to Computer ForensicsÎncărcat deBebita-Dris Jose Arnaldo
- Linear Algebra - Problem Set 1 Solutions - Arnie DrisÎncărcat deBebita-Dris Jose Arnaldo
- NNTDM_-_ISSN_1310-5132_eISSN_2367-82_25Încărcat deBebita-Dris Jose Arnaldo
- 4th Shaping the Future Forum (2013) - Accenture PH - NotesÎncărcat deBebita-Dris Jose Arnaldo
- Euclid-Euler Heuristics for (Odd) Perfect NumbersÎncărcat deBebita-Dris Jose Arnaldo
- Math 1 - Chapter 2 - Algebraic ExpressionsÎncărcat deBebita-Dris Jose Arnaldo
- herley-poster abstractÎncărcat deIf I could talk, I wouldn't.
- DrisPaper2017 Prefinaldraft Ver3 ArXiv Submit1977864Încărcat deBebita-Dris Jose Arnaldo
- Solving the Odd Perfect Number Problem: Some Old and New ApproachesÎncărcat deBebita-Dris Jose Arnaldo
- The Abundancy Index of Divisors of Odd Perfect Numbers - Part IIÎncărcat deBebita-Dris Jose Arnaldo
- Math Invs - Problem Set 1Încărcat deBebita-Dris Jose Arnaldo
- Dris.spoofÎncărcat deBebita-Dris Jose Arnaldo
- New Results for the Descartes-Frenicle-Sorli Conjecture on Odd Perfect NumbersÎncărcat deBebita-Dris Jose Arnaldo
- The Abundancy Index of Divisors of Spoof Odd Perfect NumbersÎncărcat deBebita-Dris Jose Arnaldo
- OPNPaper_2017.pdfÎncărcat deBebita-Dris Jose Arnaldo
- OPNPaper_2017Încărcat deBebita-Dris Jose Arnaldo
- Some New Results on Bounds for the Abundancy Indices of the Components of Odd Perfect Numbers - V1.7Încărcat deBebita-Dris Jose Arnaldo
- PhilNITS (IT Passport Exam Preparation Book)Încărcat deBebita-Dris Jose Arnaldo
- Dris Conjecture ArXiv Submit1853544Încărcat deBebita-Dris Jose Arnaldo
- Deficiency ArXiv Submit1843147Încărcat deBebita-Dris Jose Arnaldo
- NEW RESULTS FOR SORLI'S CONJECTURE ON ODD PERFECT NUMBERS - PART IIIÎncărcat deBebita-Dris Jose Arnaldo
- On Sorli’s Conjecture Regarding Odd Perfect Numbers - Part IIÎncărcat deBebita-Dris Jose Arnaldo
- IndexOutlaw_arXiv_submit1874825Încărcat deBebita-Dris Jose Arnaldo
- CSTRENDS IT1041 - Long Quiz 1, Trends in IT, FEU ManilaÎncărcat deBebita-Dris Jose Arnaldo
- CRITERIA FOR ALMOST PERFECT AND DEFICIENT NUMBERSÎncărcat deBebita-Dris Jose Arnaldo
- A Sufficient Condition for Disproving Descartes's Conjecture on Odd Perfect NumbersÎncărcat deBebita-Dris Jose Arnaldo
- OPNPaper17 - On a Conjecture of Dris Regarding Odd Perfect NumbersÎncărcat deBebita-Dris Jose Arnaldo
- New Results on Odd Perfect NumbersÎncărcat deBebita-Dris Jose Arnaldo
- On Sorli’s Conjecture Regarding Odd Perfect NumbersÎncărcat deBebita-Dris Jose Arnaldo

- Countable and Uncountable Nouns. TheoryÎncărcat deClaudia Pedraza
- Best Method to Solve Quadratic EquationsÎncărcat deVijay Deenanath Chauhan
- 39 Neighbor Fractions - NsNeighborFracÎncărcat deNora
- Lecture Notes - Number Theory (First Three Lectures)Încărcat deUmar Farooque
- Problems Proposed by Vasc and Arqady - Edited by Sayan MukherjeeÎncărcat deGeovane Junior
- CAHSEE Released Questions (Math)Încărcat deMr. Palacios
- Math30-1 Workbook OneÎncărcat dedeepteck000
- 05-NPSC-2009-The New Real Number System -ModifiedÎncărcat deMaz Aminin
- Rnm MacroÎncărcat dejancukerstrenggalek
- page20 MathÎncărcat deJARDEL LEITE
- Problem SetÎncărcat deWaqarAhmed
- Free PDF 30 Questions on Number SystemÎncărcat deNeha B
- Algebra Esp 2Încărcat decarmenvasquezcm
- MiscellaneousÎncărcat deapi-3822924
- Dividing Large Numbers and Finding the RemainderÎncărcat desanits591
- mn elementary math standardsÎncărcat deapi-322018148
- Mathematics and AlgorithmsÎncărcat dejlva_lkpb
- NixTheTricks2EÎncărcat deAasif Saifi
- L-1_ Sequences and SeriesÎncărcat deRahul Singh
- GCSE Maths Linear 1387 Mark Scheme June 200612Încărcat deash592
- CheatSheet Ukdw PedWayÎncărcat dePedro Nadirio Wu
- digital questionsÎncărcat deCLARITY UDT
- Finding Divisibility Through Seed NumbersÎncărcat dedivya_jaiswal_dj
- Snellen.pdfÎncărcat deKairue Fans Hardi
- 245705033-103340355-Real-Number-System-pptÎncărcat deAnkur Chopra
- jhtp8_appH_NumberSystemsÎncărcat denreid2701
- Properties of Rational NumbersÎncărcat detutorciecle123
- polynomial time primality test.pdfÎncărcat devijay
- Numbers. Divisibility Tests, HCF and LCMÎncărcat deAjay Bhat
- Std'10 - Mathematics - Exemplar ProblemsÎncărcat deSanket Nikhade

## Mult mai mult decât documente.

Descoperiți tot ce are Scribd de oferit, inclusiv cărți și cărți audio de la editori majori.

Anulați oricând.