Gaussian Integers and Gaussian Rational Numbers
-
Updated
May 21, 2024 - Jupyter Notebook
Gaussian Integers and Gaussian Rational Numbers
(CVPR2024 Highlight) Novel Class Discovery for Ultra-Fine-Grained Visual Categorization (UFG-NCD)
EPR: A Factoring and Primality checking library for C++
This repository aims to streamline your programming tasks with a variety of utility functions. Currently featuring encoding and decoding utilities, bit operations, finding modular inverse, and input sanitization.
Grand Central Dispatch like C++ threading library built around queues, thread pools and flexible backends
Compute the greatest common divisor (gcd).
Compute the least common multiple (lcm).
A BigInt can represent whole numbers larger than 2⁵³ - 1.
Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.
This program offers a C++ solution to compute the Greatest Common Divisor (GCD) of two strings, showcasing an application of the Euclidean algorithm for string manipulation.
Utilities to make coding on Apple platforms in C++ or ObjectiveC++ more pleasant
Add a description, image, and links to the gcd topic page so that developers can more easily learn about it.
To associate your repository with the gcd topic, visit your repo's landing page and select "manage topics."