DOIAbstract
AbstractFor a class of strictly increasing real valued functions f(n) we obtain an upper bound for the number of solutions of the equation∑i=1df(xi)=∑i=1df(yi),1⩽x1,…,yd⩽N
AbstractFor a class of strictly increasing real valued functions f(n) we obtain an upper bound for the number of solutions of the equation∑i=1df(xi)=∑i=1df(yi),1⩽x1,…,yd⩽N
Abstract. In this paper, we prove a weaker form of a conjecture of Mohanty and Ramasamy [6] concerni...
7 pagesInternational audienceWe use Gale duality for complete intersections and adapt the proof of t...
Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. W...
AbstractLet A1, …, Ar, x1, …, xr, and A be known positive integers. Let f(A) be the number of intege...
The paper solves a previously posed problem by proving a certain uniform bound for the number of so...
AbstractLet m and n be positive integers and p any odd prime. In this paper we consider the Diophant...
SIGLETIB: RN 4020 (774) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...
AbstractLet A1, …, Ar, x1, …, xr, and A be known positive integers. Let f(A) be the number of intege...
Abstract|In this paper, we present a simple and fast method for counting the number of nonnegative i...
For any positive integer n, let f(n) denote the number of solutions to the Diophantine equation 4
Komatsu† Abstract. We determine the number of solutions of the equation a1x1+a2x2+ · · ·+amxm = b i...
We study the Diophantine equation xm−1 x−1 = yn−1 y−1 in integers x > 1, y > 1, m > 1, n &g...
We define a computable function f from positive integers to positive integers. We formulate a hypoth...
We will deal with the equation of the title where α 1 ...
AbstractLet D be a positive integer with 2 ∤ D, and let p be an odd prime with p ∤ lD. Further let N...
Abstract. In this paper, we prove a weaker form of a conjecture of Mohanty and Ramasamy [6] concerni...
7 pagesInternational audienceWe use Gale duality for complete intersections and adapt the proof of t...
Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. W...
AbstractLet A1, …, Ar, x1, …, xr, and A be known positive integers. Let f(A) be the number of intege...
The paper solves a previously posed problem by proving a certain uniform bound for the number of so...
AbstractLet m and n be positive integers and p any odd prime. In this paper we consider the Diophant...
SIGLETIB: RN 4020 (774) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...
AbstractLet A1, …, Ar, x1, …, xr, and A be known positive integers. Let f(A) be the number of intege...
Abstract|In this paper, we present a simple and fast method for counting the number of nonnegative i...
For any positive integer n, let f(n) denote the number of solutions to the Diophantine equation 4
Komatsu† Abstract. We determine the number of solutions of the equation a1x1+a2x2+ · · ·+amxm = b i...
We study the Diophantine equation xm−1 x−1 = yn−1 y−1 in integers x > 1, y > 1, m > 1, n &g...
We define a computable function f from positive integers to positive integers. We formulate a hypoth...
We will deal with the equation of the title where α 1 ...
AbstractLet D be a positive integer with 2 ∤ D, and let p be an odd prime with p ∤ lD. Further let N...
Abstract. In this paper, we prove a weaker form of a conjecture of Mohanty and Ramasamy [6] concerni...
7 pagesInternational audienceWe use Gale duality for complete intersections and adapt the proof of t...
Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. W...
Add to ORKG