Smallest Factor: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Smallest Factor (Integer Factoring)}} == Description == Given an $n$-bit integer $N$, find a non-trivial factorization $N=pq$ (where $p, q>1$ are integers) or return that $N$ is prime. For "second category" algorithms, the running time depends solely on the size of the integer to be factored == Related Problems == Related: Integer Factoring == Parameters == <pre>n: number of bits in the integer</pre> == Table of Algorithms == Currently no al...") |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
$n$: number of bits in the integer | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Currently no algorithms in our database for the given problem. | Currently no algorithms in our database for the given problem. | ||
Latest revision as of 07:52, 10 April 2023
Description
Given an $n$-bit integer $N$, find a non-trivial factorization $N=pq$ (where $p, q>1$ are integers) or return that $N$ is prime. For "second category" algorithms, the running time depends solely on the size of the integer to be factored
Related Problems
Related: Integer Factoring
Parameters
$n$: number of bits in the integer
Table of Algorithms
Currently no algorithms in our database for the given problem.