(12C) Finding Two Factors Close to N
|
10-20-2019, 03:10 PM
Post: #1
|
|||
|
|||
(12C) Finding Two Factors Close to N
Introduction
This program finds two factors of the integer N, where one of the factors is close to, but not equal to √N as possible. Let X and Y be positive integers where: (I) N = B^2 - A^2 By the difference of squares: (II) N = (B - A) * (B + A) The program tests every integer higher than √N. Let B = int(√N) + 1. If A = N - B^2 is an integer, the search stops. The program uses the equation (II) above and places the results on the stack as such: Y Stack: B + A // the program pauses to show this result X Stack: B - A Code:
Examples: n = 22356 = 162 * 138 n = 667 = 29 * 23 n = 4120 = 206 * 20 n = 144 = 18 * 8 (remember, factors close to √n as possible, but not the square root) n = 97 = 97 * 1 (prime number) Blog post: http://edspi31415.blogspot.com/2019/10/h...teger.html |
|||
« Next Oldest | Next Newest »
|
Messages In This Thread |
(12C) Finding Two Factors Close to N - Eddie W. Shore - 10-20-2019 03:10 PM
RE: (12C) Finding Two Factors Close to N - Albert Chan - 10-20-2019, 11:02 PM
|
User(s) browsing this thread: 1 Guest(s)