{"id":25365653,"url":"https://github.com/brendanddev/discreet-math-calculator","last_synced_at":"2025-08-23T05:33:47.718Z","repository":{"id":245327611,"uuid":"817935072","full_name":"brendanddev/Discreet-Math-Calculator","owner":"brendanddev","description":"This C++ program was designed to offer a menu-driven interface for performing various discrete mathematical calculations. It includes functions for finding the Greatest Common Factor (GCF), Least Common Multiple (LCM), checking congruence modulo, verifying prime numbers, and identifying Fibonacci sequence numbers.","archived":false,"fork":false,"pushed_at":"2025-02-26T23:32:37.000Z","size":11,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-09T05:17:54.436Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","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/brendanddev.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-06-20T18:47:10.000Z","updated_at":"2025-02-26T23:32:40.000Z","dependencies_parsed_at":"2024-06-21T12:35:13.154Z","dependency_job_id":null,"html_url":"https://github.com/brendanddev/Discreet-Math-Calculator","commit_stats":null,"previous_names":["devdrendos/discreet-math-calculator","brendanddev/discreet-math-calculator"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/brendanddev/Discreet-Math-Calculator","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brendanddev%2FDiscreet-Math-Calculator","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brendanddev%2FDiscreet-Math-Calculator/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brendanddev%2FDiscreet-Math-Calculator/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brendanddev%2FDiscreet-Math-Calculator/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/brendanddev","download_url":"https://codeload.github.com/brendanddev/Discreet-Math-Calculator/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brendanddev%2FDiscreet-Math-Calculator/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271745597,"owners_count":24813509,"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","status":"online","status_checked_at":"2025-08-23T02:00:09.327Z","response_time":69,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":"2025-02-14T23:41:53.833Z","updated_at":"2025-08-23T05:33:47.689Z","avatar_url":"https://github.com/brendanddev.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Discreet-Math-Calculator\nThis C++ program was designed to offer a menu-driven interface for performing various discrete mathematical calculations. It includes functions for finding the Greatest Common Factor (GCF), Least Common Multiple (LCM), checking congruence modulo, verifying prime numbers, and identifying Fibonacci sequence numbers.\n\nThe program is designed to offer a range of discrete mathematical tools through a user-friendly interface. It begins by including necessary libraries like iostream for input/output operations and cmath for mathematical calculations. The use of using namespace std; simplifies the code by allowing direct access to standard library functions and objects.\n\nOverview of the functions: \n'gcf':\nCalculates the Greatest Common Factor (GCF) of two integers a and b using the Euclidean algorithm.\n\n'lcm':\nComputes the Least Common Multiple (LCM) of two integers a and b based on their GCF.\n\n'congruenceCalculator':\nDetermines if integers a and b are congruent modulo m by comparing their remainders.\n\n'primeCheck':\nChecks if an integer n is a prime number using basic divisibility rules.\n\n'perfSquare':\nVerifies if an integer x is a perfect square by computing its square root and checking if squaring the root results in x.\n\nEach function serves a distinct mathematical purpose within the calculator program, enabling operations related to factors, multiples, congruence, prime numbers, and perfect squares.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbrendanddev%2Fdiscreet-math-calculator","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbrendanddev%2Fdiscreet-math-calculator","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbrendanddev%2Fdiscreet-math-calculator/lists"}