Finding large prime factors (number theory)

  • Thread starter Thread starter bremenfallturm
  • Start date Start date
  • Tags Tags
    Factorization Prime
Click For Summary
To factor 314000 by hand, start by breaking it down into smaller components, recognizing that 314000 equals 314 multiplied by 1000. The factorization process involves identifying the prime factors of 1000, which is 10 cubed, or (2 * 5)^3. The number 314 can be factored into 2 and 157, leading to the complete factorization of 314000 as 2^4 * 5^3 * 157. The initial intimidation of the problem can be overcome by systematically applying basic division methods to identify prime factors. Understanding the breakdown simplifies the process significantly.
bremenfallturm
Messages
81
Reaction score
13
Homework Statement
Find the prime factorizations of 314000.
Relevant Equations
Unsure - I've tried a couple of different methods as explained in the post
Hello!

I'm asked to factor 314000 by hand. The answer key says that is is ##2^4\cdot 5^3\cdot 157##, but I honestly have no idea how to factor it by hand.

I know that I can check all prime numbers up to ##\sqrt{314000}## but that would not be doable by hand obviously.
I did try to use the method that this video suggests:
(Which basically is: try to divide by 2, try to divide by 3, try to divide by 5, try to divide by 7)
But the problem is that ##157## is a factor.
How can I factor the number by hand?
 
Physics news on Phys.org
Where is the problem?
$$
314000=314\cdot 1000=2\cdot 157 \cdot (10^3)=2\cdot 157\cdot (2\cdot 5)^3=2^4\cdot5^3\cdot 157
$$
 
  • Like
Likes berkeman, renormalize and gmax137
Oh you're right. Sometimes you're just intimidated by a problem I guess. The problem is nowhere now.
 
First, I tried to show that ##f_n## converges uniformly on ##[0,2\pi]##, which is true since ##f_n \rightarrow 0## for ##n \rightarrow \infty## and ##\sigma_n=\mathrm{sup}\left| \frac{\sin\left(\frac{n^2}{n+\frac 15}x\right)}{n^{x^2-3x+3}} \right| \leq \frac{1}{|n^{x^2-3x+3}|} \leq \frac{1}{n^{\frac 34}}\rightarrow 0##. I can't use neither Leibnitz's test nor Abel's test. For Dirichlet's test I would need to show, that ##\sin\left(\frac{n^2}{n+\frac 15}x \right)## has partialy bounded sums...