This repository contains Java programs for calculating the Greatest Common Divisor (GCD), also known as Highest Common Factor (HCF), and Least Common Multiple (LCM) of two or three numbers. These programs use iterative methods to determine GCD and LCM efficiently. Ideal for beginners learning number theory and Java basics. 🚀
active 2025-02-05 → 2025-02-05 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2025-02-05 to 2025-02-05. Pushes: 1 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| Ananthadatta02 | 1 | 1 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.