Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Hi everyone.

I'd like to refer you to two papers by Arian Berdellima on odd perfect numbers:

More Properties About Odd Perfect Numbers

http://mpra.ub.uni-muenchen.de/31587/1/MPRA_paper_31587.pdf

Perfect numbers - a lower bound for an odd perfect number

http://mpra.ub.uni-muenchen.de/31218/1/MPRA_paper_31218.pdf

I have perused both papers, and the first paper in particular appears to have shown that the Euler prime of an odd perfect number must be at least 13.

Can anybody comment as to the merit(s) of these papers?

share|improve this question

closed as not constructive by Igor Rivin, Felipe Voloch, Anthony Quas, Franz Lemmermeyer, Yemon Choi Feb 1 '12 at 18:47

As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.If this question can be reworded to fit the rules in the help center, please edit the question.

    
In particular, in Proposition 3.2 from the first paper, am I right in thinking that $\beta \ge 0$ instead of $\beta > 0$? –  Jose Arnaldo Dris Jan 28 '12 at 12:23
    
There is a meta thread on "Discussing preprints on MO" here: tea.mathoverflow.net/discussion/1059 –  Gerald Edgar Jan 28 '12 at 14:08
8  
The rule of thumb is that if a manuscript is typed in MS Word, then it's probably rubbish. ;) –  Nikita Sidorov Jan 28 '12 at 16:52
2  
This seems inappropriate, voting to close. –  Igor Rivin Jan 28 '12 at 20:08
1  
Arnie, I suspect proposition 3.1 does not hold, as q_j could be 1 mod q_i. Further, I do not see that 2beta + 1 has to divide q_i -1, as it could be a multiple of some factor of q_i -1. So yes, beta could be 0, and the conclusion does not follow in my view. I also do not see how the proof can be rescued. Gerhard "Ask Me About System Design" Paseman, 2012.02.01 –  Gerhard Paseman Feb 1 '12 at 19:09

1 Answer 1

up vote 3 down vote accepted

Dear Arnie,

In the first paper, "More properties about the odd perfect numbers", there is a flow in the statement of Little Fermat Theorem. The modular congruences that I have used should also satisfy p=1 (mod q) and q(i)=1(mod q(j)) in order for the results to be applicable. In the second paper there is no error as it was edited by few professors and also it was the topic of my senior thesis. My apologies for the misleading result.

Regards, Arian Berdellima

share|improve this answer
    
In the proof to your proposition 3.1, you start with "Since sigma(p^alpha) <> 2m^2 and sigma(m^2) <> p^alpha ..." . Could you expand on that part, as it is unclear to me how you get that from your assumptions in the statement of the proposition. Gerhard "Also Studies Odd Perfect Numbers" Paseman, 2012.02.01 –  Gerhard Paseman Feb 1 '12 at 17:34
    
In proposition 3.1 I use the result from Pomerance that if n=p^alpha*m^2 is an odd perfect number then gcd(sigma(m^2), sigma(p^alpha))<>1,therefore for some prime q(i) which divides m^2 we have that q(i)|sigma(m^2) and q(i)|sigma(p^alpha). So, (1) 1+q(j)+...+q(j)^(2beta)=0 (mod q(i)) Notice that q(i) and q(j) are both prime factors of m^2. From (1) one obtains (2) q(j)^(2beta+1)=1 (mod q(i)) Now if q(j)=1 (mod q(i)) then there is nothing to be found because q(j)^n=1 (mod q(i)), n-positive integer. The other case is when q(j)<>1 (mod q(i)). q(j) cant be a primitive root and the results follow –  Arian Feb 1 '12 at 20:11
    
In TeX: ...if $n=p^{\alpha}m^2$ is an odd perfect number then $\gcd(\sigma(m^2),\sigma(p^{\alpha}))\ne1$, therefore for some prime $q_i$ which divides $m^2$ we have that $q_i\mid\sigma(m^2)$ and $q_i\mid\sigma(p^{\alpha})$. So, (1) $1+q_j+\cdots+q_j^{2\beta}\equiv0\pmod{q_i}$. Notice that $q_i$ and $q_j$ are both prime factors of $m^2$. From (1) one obtains (2) $q_j^{2\beta+1}\equiv1\pmod{q_i}$. Now if $q_j\equiv1\pmod{q_i}$ then there is nothing to be found because $q_j^n\equiv1\pmod{q_i}$, $n$ a positive integer. The other case is when $q_j\not\equiv1\pmod{q_i}$. Continued... –  Gerry Myerson Feb 1 '12 at 22:52
    
(Continuation) $q_j$ can't be a primitive root and the results follow. –  Gerry Myerson Feb 1 '12 at 22:53
    
Thank you Garry for your assistance. I hope the paper makes more sense now. –  Arian Feb 2 '12 at 2:23

Not the answer you're looking for? Browse other questions tagged or ask your own question.