{"id":16604356,"url":"https://github.com/nahrens007/mathalgorithms","last_synced_at":"2025-08-27T02:14:28.905Z","repository":{"id":206735493,"uuid":"84666616","full_name":"nahrens007/MathAlgorithms","owner":"nahrens007","description":"Some simple math algorithms implemented using Python. ","archived":false,"fork":false,"pushed_at":"2017-03-11T17:14:27.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-17T10:07:52.023Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/nahrens007.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2017-03-11T17:11:32.000Z","updated_at":"2017-03-11T17:11:54.000Z","dependencies_parsed_at":"2023-11-11T23:28:39.966Z","dependency_job_id":"9706f358-ecaf-4587-9e19-685c9786c2de","html_url":"https://github.com/nahrens007/MathAlgorithms","commit_stats":null,"previous_names":["nahrens007/mathalgorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nahrens007%2FMathAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nahrens007%2FMathAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nahrens007%2FMathAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nahrens007%2FMathAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nahrens007","download_url":"https://codeload.github.com/nahrens007/MathAlgorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242729529,"owners_count":20175957,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-12T00:57:17.688Z","updated_at":"2025-03-09T18:03:05.034Z","avatar_url":"https://github.com/nahrens007.png","language":"Python","readme":"# MathAlgorithms\nSome simple math algorithms implemented using Python. \n\n# use_math.py\nAuthor: Nathan Ahrens, 11/21/2015\nAs an Ashland University student in Math 223 (Discrete Mathematics), \nI learned intermediate algorithms to finding the prime factorizations,\ngreatest common divisors, and least common multiples and thought it\nwould be useful to implement these algorithms into a program. \u003cbr/\u003e\u003cbr/\u003e\nIn this program, I make use of my own custom Mathematics module to allow the \nuser to easily find GCD's, LCM's, prime factorizations, and convert\na binary number (base 2) to a numeric number (base 10).\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnahrens007%2Fmathalgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnahrens007%2Fmathalgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnahrens007%2Fmathalgorithms/lists"}