Skip to main
Zenodo home
Communities
My dashboard
Log in Sign up
Published 2024 – 2025 | Version v7
Publication Open

Parity-and Modulus-Based Decomposition Framework for Odd Perfect Numbers

Authors/Creators

  • Mayo, Walter (Researcher) ORCID icon

Description

An approach to resolve the odd perfect number problem. 

Files

Odd_Perfect_7.pdf

Files (173.7 kB)

Name Size Download all
Odd_Perfect_7.pdf
md5:84f3979142a0a2af2106eb1f4c6c3f65
173.7 kB Preview Download
99
Views
91
Downloads
Show more details
All versions This version
Views

Total views

99 31
Downloads

Total downloads

91 17
Data volume

Total data volume

16.5 MB 3.1 MB

More info on how stats are collected....

Versions

External resources

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.17546203
DOI Badge

DOI

10.5281/zenodo.17546203

Markdown

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.17546203.svg)](https://doi.org/10.5281/zenodo.17546203)

reStructuredText

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.17546203.svg
  :target: https://doi.org/10.5281/zenodo.17546203

HTML

<a href="https://doi.org/10.5281/zenodo.17546203"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.17546203.svg" alt="DOI"></a>

Image URL

https://zenodo.org/badge/DOI/10.5281/zenodo.17546203.svg

Target URL

https://doi.org/10.5281/zenodo.17546203
Resource type
Publication
Publisher
Zenodo

Rights

License
cc-by-4.0 icon Creative Commons Attribution 4.0 International
The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited. Read more

Citation

Export

Technical metadata

Created
November 6, 2025
Modified
November 6, 2025

About

  • About
  • Policies
  • Infrastructure
  • Principles
  • Projects
  • Roadmap
  • Contact

Blog

  • Blog

Support

  • Help
  • FAQ

Developers

  • REST API
  • OAI-PMH

Contribute

  • GitHub
  • Donate

Funded by

Powered by CERN Data Centre & InvenioRDM

  • Status
  • Privacy policy
  • Cookie policy
  • Terms of Use

This site uses cookies. Find out more on how we use cookies