A New Method of Factoring Large Integers

Abstract In this paper, we reduce a large integer $latex N$ to an integer $latex N^\prime$, which has a smaller number of decimal digits than $latex N$. Then we find the greatest common divisor (gcd) of $latex N$ and $latex N^\prime$ to return a nontrivial factor of $latex N$. Introduction The branch of mathematics that... Continue Reading →

Goldbach Conjecture

According to Golbach's conjecture, every even greater than 2 is the sum of two primes. Here we experimentally demonstrate that it is only true if there are infinitely many primes. Theorem: There are infinitely many primes. Proof: We prove this using Goldbach conjecture. Suppose a finite set of prime numbers P = {p1, p2, …,... Continue Reading →

Blog at WordPress.com.

Up ↑