## New answers tagged divisors-multiples

7
votes

Accepted

### Divisibility chains and polynomials

Every $P$ is a counterexample. Indeed, given a polynomial $P$ consider the recursive sequence $b_{n+1}=f(b_n)$ where I take $f(x)=x+P(x)$, say. Then $P(b_{n+1}) = P(b_n + P(b_n)) \equiv P(b_n) \equiv ...

- 9,364

1
vote

### On the diophantine equation $x^{m-1}(x+1)=y^{n-1}(y+1)$ with $x>y$, over integers greater or equal than two

Paper by L.D.Lehmer, "On a problem by Stormer", pp.57-79, Illinois J.Math. (received July 25, 1962; that's all the info about the paper that I have + a reprint) is related and should be ...

- 3,824

1
vote

### On the diophantine equation $x^{m-1}(x+1)=y^{n-1}(y+1)$ with $x>y$, over integers greater or equal than two

EDIT This answer doesn't satisfy OP's assumptions.
Currently keeping it because of existence of infinitely many solutions over extensions of the integers and the relation with N-conjecture.
If you ...

- 23.6k

8
votes

Accepted

### On the diophantine equation $x^{m-1}(x+1)=y^{n-1}(y+1)$ with $x>y$, over integers greater or equal than two

You can make a lot of progress if you're willing to assume a deep conjecutre. The $N$-variable generalization of the $abc$-conjecture (https://en.wikipedia.org/wiki/N_conjecture) applied to your ...

- 42.7k

Top 50 recent answers are included

#### Related Tags

divisors-multiples × 202nt.number-theory × 191

analytic-number-theory × 60

prime-numbers × 39

perfect-numbers × 38

reference-request × 23

arithmetic-functions × 16

diophantine-equations × 13

integer-sequences × 13

co.combinatorics × 11

conjectures × 10

factorization × 9

polynomials × 8

inequalities × 8

asymptotics × 6

additive-combinatorics × 5

open-problems × 5

congruences × 5

probabilistic-number-theory × 5

ds.dynamical-systems × 4

riemann-hypothesis × 4

matrices × 3

sequences-and-series × 3

arithmetic-progression × 3

stirling-numbers × 3