More Connections on Valuated Binary Tree and Their Applications in Factoring Odd Integers

Abstract

This paper continues investigating connections on a valuated binary tree. By defining three types of new connections, the paper derives several new properties for the new connections, and proves that odd integers matching to the new cases can be easily and rapidly factorized. Proofs are presented for the new properties and conclusions with detail mathematical reasoning and numerical experiments are made with Maple software to demonstrate the fast factorization by factoring big odd composite integers that are of the length from 101 to 105 decimal digits. Source codes of Maple programs are also list for readers to test the experiments.