Smallest Factor: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:2011:20, 15 February 2023‎ Admin talk contribs‎ 522 bytes +522‎ 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..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Smallest_Factor"