Rb1960 / Magnanimous-Numbers-Python

A solution for the Rosseta Code Magnanimous Numbers Task in Python

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

License: GPL v3

Magnanimous Numbers in Python

This repository will contain my solution for the Rosseta Code Magnanimous Numbers Task in Python I have used this task as a vechicle to experiment using Behaviour Driven Desgin (BDD) technique; using the BDD Plugin for the Python Pytest Framework, and practise in creating and managing my first Github project.

The Task

As described in the Rosseta Code page the task requirements are:

* Write a routine (procedure, function, whatever) to find magnanimous numbers.
* Use that function to find and display, here on this page the first 45 magnanimous numbers.
* Use that function to find and display, here on this page the 241st through 250th magnanimous numbers.
* Stretch: Use that function to find and display, here on this page the 391st through 400th magnanimous numbers

Road Map

  • Create the Repository and README,
  • Write a program (Magnanimous) to generate the first 45 Magnanimous numbers by default; the first Task objective,
  • Impllement code to achieve objective 2 & 3,
  • Upload the code to Rosseta Code,
  • Extend Magnanimous with a Command Line Interface (CLI) that will:
    • provide a help system,
    • check if a specific number is Magnanimous,
    • list Magnanimous numbers within a given range,
    • list a specified number of Magnanimous numbers from a speficed start position.

Built With

Python PyCharm

About

A solution for the Rosseta Code Magnanimous Numbers Task in Python

License:GNU General Public License v3.0