Only Strategy I am aware of for finding factors efficiently is sieve of eratosthenes but from sieve I first have to pre-compute the prime numbers less than than $\sqrt{n}$. I want to skip this computation and implement an $O(\log(n))$ solution. Is there any such solution?
2026-02-22 23:39:13.1771803553
Finding Prime Factors of a number in $\log(n)$
1k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PRIME-NUMBERS
- New prime number
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- How do I prove this question involving primes?
- What exactly is the definition of Carmichael numbers?
- I'm having a problem interpreting and starting this problem with primes.
- Decimal expansion of $\frac{1}{p}$: what is its period?
- Multiplying prime numbers
- Find the number of relatively prime numbers from $10$ to $100$
- A congruence with the Euler's totient function and sum of divisors function
- Squares of two coprime numbers
Related Questions in PRIME-FACTORIZATION
- For which natural numbers are $\phi(n)=2$?
- Fractions of the form $\frac{a}{k}\cdot\frac{b}{k}\cdot\frac{c}{k}\cdots=\frac{n}{k}$
- (Number of perfect powers ≤ n) ∼ $\sqrt{n}$?
- How do I solve complicated prime factorization problems? (Ex: 20711)
- Is there a pattern to addition of primesFactored numbers?
- Proof of Fundamental Theorem of Arithmetic: Uniqueness Part of Proof
- Find a prime factor of $7999973$ without a calculator
- Proof verification: Let $gcd(x,y)=1$. If $xy$ is a perfect square, then $x$ and $y$ are perfect squares.
- An idea for approaching Brocard's problem ($n!+1=m^2$)
- Looking for complex roots of unity which also happen to be complex primes
Related Questions in COMPUTATIONAL-MATHEMATICS
- The equivalent of 'quantum numbers' for a mathematical problem
- Skewes' number, and the smallest $x$ such that $\pi(x) > \operatorname{li}(x) - \tfrac1n \operatorname{li}(x^{1/2})$?
- Approximating a derivative through Newton interpolation
- What is the value of $2x+3y$?
- Good free calculator for manipulating symbolic matrices of 6x6 and larger?
- How to convert an approximation of CCDF for a standard normal to an approximation with a different mean and variance?
- Simple recursive algorithms to manually compute elementary functions with pocket calculators
- Asymptotic notation proof
- Graph layout that reflects graph symmetries
- What is the most efficient computation of the permanent?
Related Questions in SIEVE-THEORY
- Sieve of Eratosthenes : why $\sqrt n$ work?
- Bounding the number of semiprimes of the form $2p\pm1$
- Asymptotic relations of $x$ and $x/(\log\log x)$
- Modified sieve to find count all the divisors from 1 to n in o(n) time
- Finding Prime Factors of a number in $\log(n)$
- Probability that a random number avoids a set of prime divisors
- In the General Number Field Sieve, can we estimate the size of the matrix in terms of the number being factored?
- How to tell if a particular number will survive in this sieve?
- How long would it take a computer to check that a number is not divisible by any 20-digit prime?
- Infinitely many primes $p$ such that $\frac{p-1}{2}$ is a product of two primes
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
No. As determining whether a number $n$ is prime is in $O(n)$, finding a prime factor is obviously also in $O(n)$.