Description
These two programs aim to find two prime numbers that have been multiplied with each other. PRIME6 is as simple as possible, and PRIME6D is a demo version. The idea is to find a number that is close to a multiple to one of the primes: plus, minus 167. To do that the program typically selects the first four and the last four digits to C and D. The demo version shows them and their GCD, and then prime factors them. Then they bring them to both to have a divisor 3 by subtracting 7 for C once unconditionally, and then repeatedly if necessary. This is done conditionally for D as well. The demo version then shows the initial product and the new values for C and D, plus what’s left in between them. the numbers are augmented to B, which is processed according to how many times 7 has been subtracted respectively. The demo version shows the value B divided with the two primes as it goes. I am grateful for input about how it works for you. I have not tried very many combinations yet, but it seems that when I input two Fermat primes, they are immune to the process, so there is a specific section in the program for them. Update: This version has had some bug fixes and cosmetic improvements.
Archive Contents
| Name | Size |
|---|---|
| PRIME6.g3m | 848 bytes |
| PRIME6&PRIME6D.rtf | 1.8 KB |
| PRIME6D.g3m | 1.1 KB |
- File Size
- 3.9 KB
- Short link
- http://ceme.tech/DL2375
Metadata
- Author
- Anders
- Uploaded
- 1 year, 1 month ago
Statistics
- Rating
- No ratings.
- Downloads
- 593
- ↳ this version
- 374
- Views
- 2578
- ↳ this version
- 2005
Reviews
Nobody has reviewed this file yet.Versions
- PRIME6&6D (published 1 year, 1 month ago; 2023-09-06 20:55 UTC)
- PRIME6&6D (published 1 year, 1 month ago; 2023-08-12 20:49 UTC)
Advertisement