Skip to main content

New answers tagged

2 votes

On a efficient algorithm for factoring bivariate polynomials modulo composite modulus assuming the solution is unique

We wrote a 2 page preprint on researchgate Abstract: We give efficient probabilistic algorithm for factoring bivariate polynomials modulo composite integers with unknown factorization assuming the ...
joro's user avatar
  • 24.3k
23 votes
Accepted

Does this sequence ever end?

This is John H. Conway's Climb to a prime problem. Conway originally conjectured that no matter what number you start with, you will eventually converge to a prime. This conjecture was disproven by ...
Timothy Chow's user avatar
  • 79.3k
8 votes

Does this sequence ever end?

Probably an interesting question is why it seems that with base $2$ instead of $10$ and the same procedure, we get large primes: (Notice that for $d=2$ the starting number $20$ gets a prime). ...
mathoverflowUser's user avatar

Top 50 recent answers are included