https://github.com/anthhon/prime-breaker

A simple and efficient way to find two prime numbers that multiply to a given
https://github.com/anthhon/prime-breaker

Last synced: about 2 months ago
JSON representation

A simple and efficient way to find two prime numbers that multiply to a given

• Host: GitHub
• URL: https://github.com/anthhon/prime-breaker
• Owner: Anthhon
• Created: 2023-01-01T18:32:08.000Z (about 2 years ago)
• Default Branch: main
• Last Pushed: 2023-04-09T03:57:09.000Z (almost 2 years ago)
• Last Synced: 2024-11-16T12:09:31.815Z (about 2 months ago)
• Language: Rust
• Homepage:
• Size: 296 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# prime-breaker

Overall, this program is a simple and efficient way to find two prime numbers that multiply to a given one

This C program is designed to find two prime numbers that multiply to a target prime number.

The program uses an efficient prime number checking algorithm based on the Sieve of Eratosthenes to quickly determine

if a number is prime or not. The program also includes a timer to measure how long it takes to find the two prime numbers.