S. S. Rout

activity

20132026

most citedOn the resolution of the Diophantine equation

U_{n} + U_{m} = x^{q}

2 citations · 5 across the 17 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

math.NT2016

Linear combinations of prime powers in sums of terms of binary recurrence sequences

N. K. Meher, S. S. Rout

Let ${U_{n}}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. Let ${p_{1}, \dots, p_{s}}$ be fixed prime numbers and ${b_{1}, \dots, b_{s}}$ …

math.NT2016

Linear combinations of factorials in binary recurrence sequences

Sudhansu Sekhar Rout

Let ${u_{n}}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \c…

math.NT2016★ 2 cited

Prime powers in sums of terms of binary recurrence sequences

Eshita Mazumdar, S. S. Rout

Let ${u_{n}}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive, square-free discriminant and $p$ be a fixed prime number. In this paper, we have shown the…