Finds two factors of a large number whose factors are close together (sharing identical digits for the most significant half)
-
Updated
Apr 20, 2018 - Python
Finds two factors of a large number whose factors are close together (sharing identical digits for the most significant half)
Разбивает натуральное число на простые множители
This project tackles the RSA Factoring Challenge, which aims to identify two prime factors 'p' and 'q' of a given number 'n' efficiently and quickly.
Python CMD program for printing the number with most prime factors, from a list of 10 entered numbers.
Add a description, image, and links to the prime-factors topic page so that developers can more easily learn about it.
To associate your repository with the prime-factors topic, visit your repo's landing page and select "manage topics."