Intereting Posts

Extending a homeomorphism of a subset of a space to a $G_\delta$ set
If a cyclic group has an element of infinite order, how many elements of finite order does it have?
A normed space is locally compact iff its closed unit ball is compact.
If $A^2\succ B^2$, then necessarily $A\succ B$
What's bad about calling $i$ “the square root of -1”?
the constant in the asymptotics of $\sum_{1\le k \le n} \frac{\varphi(k)}{k^2}$
Multiplying complex numbers in polar form?
is a one-by-one-matrix just a number (scalar)?
Class Group of $\mathbb{Q}(\sqrt{-47})$
When do I use “arbitrary” and/or “fixed” in a proof?
Helmholtz theorem
How many bracelets can be formed?
$\tbinom{2p}{p}-2$ is divisible by $p^3$
Finding the homology group of $H_n (X,A)$ when $A$ is a finite set of points
If the left Riemann sum of a function converges, is the function integrable?

What are techniques to factor numbers that are the product of two prime numbers? For example, how would we factor $262417$ to get $397\cdot 661$? Would we have to guess that factorization or is there an easier way?

- Primes for which $x^k \equiv n \pmod{p}$ is solvable
- Prove that the class number of $\mathbb{Z}$ is $1$
- A Problem on the Möbius Function
- Why do lattice cubes in odd dimensions have integer edge lengths?
- Riemann Hypothesis and the prime counting function
- Proving the Möbius formula for cyclotomic polynomials
- Solving the congruence $3x^2 + 6x + 1 \equiv 0 \pmod {19}$
- If $p\equiv 1,9 \pmod{20}$ is a prime number, then there exist $a,b\in\mathbb{Z}$ such that $p=a^{2}+5b^{2}$.
- Form of rational solutions to $a^2+b^2=1$?
- Proving $\sqrt{2}\in\mathbb{Q_7}$?

The problem of the factorization is the main property of some cryptograpic systems as RSA.

This fact has been studied for years and nowadays we don’t know a algorithm to factorize a big arbitrary number efficiently.

However, if $p*q$ satisfies some propierties (e.g $p-1$ or $q-1$ have a soft factorization (that means the number factorizes in primes $p$ such that $p \leq \sqrt{n}$)), you can factorize the number in a computational time of $O(log(n))$ (or another low comptutational time)

If you are interested in it, you can check this pdf with some famous attacks to the security of RSA related with the fact of factorization of large numbers.

http://www.nku.edu/~christensen/Mathematical%20attack%20on%20RSA.pdf

There is an easier way. The length of prime numbers is not a problem – it is the randomness that lies within.

Let $n=262417$

$397 + 661 = 1058$

$1058 / 2 = 529 = d$

$d^2 = 279841 = a$

Let $s = a – n$

$s = 279841 – 262417 = 17424$ (this square defines distance between $p$ and $q$)

$\sqrt{s} = 132 = t$

$n = p \cdot q$

$n = (d + t)(d – t)$

$n = (529 + 132)(529 – 132) = 661 \cdot 397 = 262417$

To find $s$ you need to know pattern in prime numbers, which will also help you structure semiprime $n$ – “an almost beautiful” arithmetic progression.

- Is number rational?
- Explanation of the Fibonacci sequence appearing in the result of 1 divided by 89?
- Does every non-empty topological space have an irreducible closed subset?
- Different way solving limit $\lim \limits_{ x\rightarrow 0 }{ { x }^{ x } } $
- Dominant term and Big Omega
- What do following asymptotic symbols mean?
- If $T^2=TT^*$ then can i conclude that $T=T^*$?
- Why does proof by contrapositive make intuitive sense?
- How to algebraically prove $\binom{n+m}{2} = nm + \binom{n}{2} + \binom{m}{2}$?
- In every power of 3 the tens digit is an even number
- Matrix Norm set #2
- EGF of rooted minimal directed acylic graph
- $I-AB$ be invertible $\Leftrightarrow$ $I-BA$ is invertible
- number of permutations in which no two consecutive numbers are adjacent
- Is every locally compact Hausdorff space paracompact?