AbstractIn the Frobenius problem with two variables, one is given two positive integers a and b that are relative prime, and is concerned with the set of positive numbers NR that have no representation by the linear form ax+by in nonnegative integers x and y. We give a complete characterization of the set NR, and use it to establish a relation between the power sums over its elements and the power sums over the natural numbers. This relation is used to derive new recurrences for the Bernoulli numbers
Let $a,b$ be positive, relatively prime, integers. We prove, using induction, that for every $d > ab...
AbstractThe alternate Sylvester sums are Tm(a,b)=∑n∈NR(−1)nnm, where a and b are coprime, positive i...
Let a1, a2, ..., an be relative prime positive integers. The Frobenius problem is to determine the g...
AbstractIn the Frobenius problem with two variables, one is given two positive integers a and b that...
The famous linear diophantine problem of Frobenius is the problem to determine the largest integer (...
Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is t...
We present a proof of an identity involving the Bernoulli numbers. This identity has been proved, ov...
We present a proof of an identity involving the Bernoulli numbers. This identity has been proved, ov...
AbstractWe extend Euler's well-known quadratic recurrence relation for Bernoulli numbers, which can ...
Given a positive integer n and a set of relatively prime positive integers a1 , ..., ak ,\ud we say ...
AbstractThe Diophantine Problem of Frobenius is to find a formula for the least integer not represen...
AbstractWe study the Frobenius problem: given relatively prime positive integers a1,…,ad, find the l...
In this paper we study a certain kind of generalized linear Diophantine problem of Frobenius. Let $a...
AbstractWe extend Euler's well-known quadratic recurrence relation for Bernoulli numbers, which can ...
We introduce and review the Frobenius Problem, determining the greatest integer not expressible as a...
Let $a,b$ be positive, relatively prime, integers. We prove, using induction, that for every $d > ab...
AbstractThe alternate Sylvester sums are Tm(a,b)=∑n∈NR(−1)nnm, where a and b are coprime, positive i...
Let a1, a2, ..., an be relative prime positive integers. The Frobenius problem is to determine the g...
AbstractIn the Frobenius problem with two variables, one is given two positive integers a and b that...
The famous linear diophantine problem of Frobenius is the problem to determine the largest integer (...
Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is t...
We present a proof of an identity involving the Bernoulli numbers. This identity has been proved, ov...
We present a proof of an identity involving the Bernoulli numbers. This identity has been proved, ov...
AbstractWe extend Euler's well-known quadratic recurrence relation for Bernoulli numbers, which can ...
Given a positive integer n and a set of relatively prime positive integers a1 , ..., ak ,\ud we say ...
AbstractThe Diophantine Problem of Frobenius is to find a formula for the least integer not represen...
AbstractWe study the Frobenius problem: given relatively prime positive integers a1,…,ad, find the l...
In this paper we study a certain kind of generalized linear Diophantine problem of Frobenius. Let $a...
AbstractWe extend Euler's well-known quadratic recurrence relation for Bernoulli numbers, which can ...
We introduce and review the Frobenius Problem, determining the greatest integer not expressible as a...
Let $a,b$ be positive, relatively prime, integers. We prove, using induction, that for every $d > ab...
AbstractThe alternate Sylvester sums are Tm(a,b)=∑n∈NR(−1)nnm, where a and b are coprime, positive i...
Let a1, a2, ..., an be relative prime positive integers. The Frobenius problem is to determine the g...