Is there a theorem or algorithm which would help me factor a 6-digit number into primes? I need to do it by hand (of course I can use a calculator, but not factoring programs or something like that).

Printable View

- Sep 9th 2011, 09:41 AMGytaxPrime factoring a large number.
Is there a theorem or algorithm which would help me factor a 6-digit number into primes? I need to do it by hand (of course I can use a calculator, but not factoring programs or something like that).

- Sep 9th 2011, 10:09 AMProve ItRe: Prime factoring a large number.
Have you ever heard of a factor tree?

Prime Factorization - Sep 9th 2011, 12:07 PMGytaxRe: Prime factoring a large number.
- Sep 9th 2011, 12:26 PMPlatoRe: Prime factoring a large number.
You said that you cannot use a calculator.

Then it has to be do 'by hand'

Each time you find a factor, that reduces the problem.

If the number is even, then 2 is a factor. Deduce it to half the number.

In each reduction, you need only test primes up to the square root of the reduced number. - Sep 10th 2011, 12:32 AMGytaxRe: Prime factoring a large number.
I said that I can use a calculator, just not WolframAlpha via computer or that kind of solvers. That 6-digit is the product of two 3-digit numbers so I can't just check so much numbers.

- Sep 10th 2011, 04:10 AMCaptainBlackRe: Prime factoring a large number.
As a composite number $\displaystyle N$ has a prime divisor $\displaystyle \le \sqrt{N}$, for six digit numbers you only need check primes up to $\displaystyle \sqrt{N}$ and since

$\displaystyle \pi(N)\sim \frac{N}{\ln(N)}$

the number of primes less than $\displaystyle \sqrt(N)$ is $\displaystyle \sim \le \frac{1000}{\ln(1000)}\approx 145$.

So in general that is less than 145 trial divisions to find the first prime divisor, and every thing accelerates from there..

(There are in fact 168 primes less than the 1000)

CB