https://github.com/brendanddev/discreet-math-calculator
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.
https://github.com/brendanddev/discreet-math-calculator
Last synced: 10 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/brendanddev/discreet-math-calculator
- Owner: brendanddev
- Created: 2024-06-20T18:47:10.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2025-02-26T23:32:37.000Z (over 1 year ago)
- Last Synced: 2025-04-09T05:17:54.436Z (about 1 year ago)
- Language: C++
- Size: 10.7 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Discreet-Math-Calculator
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.
The 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.
Overview of the functions:
'gcf':
Calculates the Greatest Common Factor (GCF) of two integers a and b using the Euclidean algorithm.
'lcm':
Computes the Least Common Multiple (LCM) of two integers a and b based on their GCF.
'congruenceCalculator':
Determines if integers a and b are congruent modulo m by comparing their remainders.
'primeCheck':
Checks if an integer n is a prime number using basic divisibility rules.
'perfSquare':
Verifies if an integer x is a perfect square by computing its square root and checking if squaring the root results in x.
Each function serves a distinct mathematical purpose within the calculator program, enabling operations related to factors, multiples, congruence, prime numbers, and perfect squares.