Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I built out a sequence where you take some large integer n, and a smaller positive integer x, the first number in the sequence, such that the next number in the sequence, x_1, is the remainder plus the dividend of n/x, x_2 is the remainder plus the dividend of n/x_1, and so on until you reach a cycle. The problem I'm trying to solve is given some n and some x can you give at least two solutions for x_-1 (one number previous in the sequence)?


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: