I have been working on constructing a method to factor composite numbers composed of two odd prime numbers a and b. As a result, I have been experimenting numerically with various patterns to see if I could find some patterns that would reveal information about composites of two prime numbers that I might use in furthering my progress toward my ultimate goal of constructing a general factoring algorithm that involves solving a system of algebraic equations to factor the composite. I have yet to find a method, but have decided to post what I have so far over the next couple of weeks for others with fresh eyes to take a look at and critique. I will start by laying out a series of theorems in the first post, and then in following posts will elaborate on each theorem and attempt to prove them. Any suggestions, ideas, and questions are most welcome at any time. I also ask for ideas on how I may be able to better present these ideas in ways that would be more effective. Thanks for all of your assistance!(adsbygoogle = window.adsbygoogle || []).push({});

Sincerely,

Edwin

Theorem 1)

Every number [tex]C[/tex] that is an odd number composed of two prime numbers [tex]a[/tex] and [tex]b[/tex] such that

[tex]\begin{gather*}C = a*b\end{gather*}[/tex]

can be written as the sum of n consecutive odd integers.

Theorem 2)

If [tex]C[/tex] is an odd number composed of two prime factors [tex]a[/tex] and [tex]b[/tex], then the number of consecutive odd integers required to add up to [tex]C[/tex], is equal to the smaller of the two prime factors of [tex]C[/tex].

Theorem 3)

The larger of the two prime factors of [tex]C[/tex] is the average to the first and last number in the consecutive sum of odd numbers that add up to [tex]C[/tex].

Theorem 4)

If [tex]C[/tex] is an odd number that is composed of two prime factors [tex]a[/tex] and [tex]C[/tex], then there exists atleast one non-arbitrary perfect square that can be used to factor [tex]C[/tex] through a finite number of algebraic operations.

Theorem 5)

If [tex]C[/tex] is an odd number that is composed of two prime factors [tex]a[/tex] and [tex]b[/tex], then the non-arbitrary perfect square that can be used to factor [tex]C[/tex] via finite number of algebraic operations is the first perfect square acquired by adding a consecutive number of odd integers starting with the number 1 to [tex]C[/tex] and is equal to the average of the prime factors of [tex]C[/tex] quantity squared.

Example:

77 is a composite [tex]C[/tex] composed of prime factors 7 and 11.

77+1 = 78

77+1 +3 = 81

81 is the first perfect square aquired by adding consecutive odd integers to composite number 77, and ((7 + 11)/(2))^2 = 9^2 = 81.

Over the next few posts I will briefly elaborate on each of the above theorems. I will try to do so concisely in a brief post for each of the theorems above that can be read quickly and percieved quickly and clearly.

Best Regards,

Edwin G. Schasteen

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Properties of Composites Composed of Two Odd Prime Factors

Loading...

Similar Threads - Properties Composites Composed | Date |
---|---|

I Proving a property when elements of a group commute | Mar 29, 2017 |

I Proving Matrix exponential property | Oct 8, 2016 |

I Transpose Property (where's my mistake) | Aug 28, 2016 |

I Properties of Tensor Products - Cooperstein, Theorem 10.3 | Mar 29, 2016 |

Properties of Composites Composed of Two Odd Prime Factors | Nov 21, 2005 |

**Physics Forums - The Fusion of Science and Community**