Add to ORKGIn this paper, we present a simple and fast method for counting the number of nonnegative integer solutions to the equality a1x1+a2x2+: : :+arxr = n where a1; a2; :::; ar and n are positive integers. As an application, we use the method for finding the number of solutions of a Diophantine inequality
This thesis is concerned with finding integer solutions to certain Diophantine equations. In doing s...
Diophantine equations are polynomial equations whose solutions are required to be integer numbers. T...
AbstractIn this paper, we prove the equation in the title has no positive integer solutions (x,y,n) ...
Abstract|In this paper, we present a simple and fast method for counting the number of nonnegative i...
AbstractLet A1, …, Ar, x1, …, xr, and A be known positive integers. Let f(A) be the number of intege...
AbstractLet a, b, c, d be given nonnegative integers with a,d⩾1. Using Chebyshevʼs inequalities for ...
AbstractLet A1, …, Ar, x1, …, xr, and A be known positive integers. Let f(A) be the number of intege...
We study solvability of the Diophantine equation in integers satisfying the conditions and for . The...
Stiller proved that the Diophantine equation x2+119=15 · 2n has exactly six solutions in positive in...
A particular case of a conjecture of Erdös and Graham, which concerns the number of integer points o...
Stiller proved that the Diophantine equation x2+119=15 · 2n has exactly six solutions in positive in...
Let A, B be positive integers and q a prime. In this paper, we prove that the Ramanujan-Nagell type ...
AbstractWe prove that the equation x2 − kxy + y2 + x = 0 with k ϵ N+ has an infinite number of posit...
Let A, B be positive integers and q a prime. In this paper, we prove that the Ramanujan-Nagell type ...
This thesis is concerned with finding integer solutions to certain Diophantine equations. In doing s...
This thesis is concerned with finding integer solutions to certain Diophantine equations. In doing s...
Diophantine equations are polynomial equations whose solutions are required to be integer numbers. T...
AbstractIn this paper, we prove the equation in the title has no positive integer solutions (x,y,n) ...
Abstract|In this paper, we present a simple and fast method for counting the number of nonnegative i...
AbstractLet A1, …, Ar, x1, …, xr, and A be known positive integers. Let f(A) be the number of intege...
AbstractLet a, b, c, d be given nonnegative integers with a,d⩾1. Using Chebyshevʼs inequalities for ...
AbstractLet A1, …, Ar, x1, …, xr, and A be known positive integers. Let f(A) be the number of intege...
We study solvability of the Diophantine equation in integers satisfying the conditions and for . The...
Stiller proved that the Diophantine equation x2+119=15 · 2n has exactly six solutions in positive in...
A particular case of a conjecture of Erdös and Graham, which concerns the number of integer points o...
Stiller proved that the Diophantine equation x2+119=15 · 2n has exactly six solutions in positive in...
Let A, B be positive integers and q a prime. In this paper, we prove that the Ramanujan-Nagell type ...
AbstractWe prove that the equation x2 − kxy + y2 + x = 0 with k ϵ N+ has an infinite number of posit...
Let A, B be positive integers and q a prime. In this paper, we prove that the Ramanujan-Nagell type ...
This thesis is concerned with finding integer solutions to certain Diophantine equations. In doing s...
This thesis is concerned with finding integer solutions to certain Diophantine equations. In doing s...
Diophantine equations are polynomial equations whose solutions are required to be integer numbers. T...
AbstractIn this paper, we prove the equation in the title has no positive integer solutions (x,y,n) ...