RhoDem

Pollard Rho Demonstration

The sequence is defined by $u(i+1)\equiv u(i)^2+c\pmod n$. With cycle detection enabled, the table also compares $u(i)$ with $u(2i)$.

Enter $n$:

Enter $c$:

Use cycle-detecting algorithm

Maximum number of rows: