SearcharxivSearch

arXiv · 1610.00544

Nouvelles conditions pour l'inexistence des nombres parfaits impairs

Abstract

We will show the two following results: If there existe an odd perfect number $n$ of prime decomposition $n=p_1^{\alpha_1} \ldots p_k^{\alpha_k}q^\beta$, where the $\alpha_i$ are even, the $\beta$ are odd and $q \equiv 5 \mod 8$. Then there is at least one $p_i$, $1 \leq i \leq k$ that is not a square in $\mathbb{Z}/q\mathbb{Z}$. More precisely there is an odd number of $p_i$ that are not squares in $\mathbb{Z}/q\mathbb{Z}$. If there exist an odd perfect number $n$ of prime decomposition $n=p_1^{\alpha_1} \ldots p_k^{\alpha_k}q^\beta$, where the $\alpha_i$ are even, the $\beta$ are odd and $p_{k+1} \equiv {1\mod 8}$. Then at least one $p_i$, $1 \leq i \leq k+1$ is a non zero square in at least one $\mathbb{Z}/{p_j}\mathbb{Z}$, $1 \leq j \leq k+1$. Contains an appendix of known results. ----- Un nombre, $n$, est dit parfait s'il est \'egal \`a la somme de ses diviseurs propres plus 1. Par exemple $6=1+2+3$. Dans ce document, les deux propositions suivantes seront d\'emontr\'ees: S'il existe un nombre parfait impair, $n$, de d\'ecomposition en nombre premier $n=p_1^{\alpha_1} \ldots p_k^{\alpha_k}q^\beta$, o\`u les $ \alpha_i$ sont pairs, $\beta$ est impair et $q \equiv 5 \mod 8$. Alors, au moins un $p_i$, $1 \leq i \leq k$ n'est pas un carr\'e dans $\mathbb{Z}/q\mathbb{Z}$. Plus pr\'ecis\'ement un nombre impair de $p_i$ ne sont pas des carr\'es dans $\mathbb{Z}/q\mathbb{Z}$. S'il existe un nombre parfait impair, $n$, de d\'ecomposition en nombre premier $n=p_1^{\alpha_1} \ldots p_k^{\alpha_k}q^\beta$, o\`u les $\alpha_i$ sont pairs, $\beta$ est impair et $p_{k+1} \equiv {1\mod 8}$. Alors au moins un $p_i$, $1 \leq i \leq k+1$ est un carr\'e non nul dans au moins un $\mathbb{Z} / {p_j}\mathbb{Z}$, $1 \leq j \leq k+1$. Contiens une annexe contenant les r\'esultats d\'ej\`a connus et des preuves que j'en ai faites.

Explore related subjects

Keep this discovery

BibTeXRIS

Nancy Wallace. 2016-09-28. Nouvelles conditions pour l'inexistence des nombres parfaits impairs. https://arxiv.org/abs/1610.00544

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO