AbstractThe localization LS(x) of log(1 + x) at a set of primes S is defined by taking those powers of x in the logarithmic series for log(1 + x) which lie in the span of S. The functional inverse LS−1(x) of LS(x) also localizes the functional inverse ex − 1 of log(1 + x) and a generalization of the Von Staudt-Clausen theorem is proved for the even coefficients in the power series expansion for xLS−1(x). This reduces to the Von Staudt-Clausen theorem when S is the set of all primes and to a weaker version of Theorem 3.9 of I. Dibag (J. Algebra87 (1984), 332–341) when S consists of a single prime
AbstractIf b(m;n) denotes the number of partitions of n into powers of m, then b(m; mr+1n) ≡ b(m; mr...
AbstractWe continue the discussion of the numbers c(G) and r(G) defined in [1]. The following result...
AbstractThe concept of quasi-multiplication is used to describe the theory of polynomial sequences, ...
The localization LS(x) of log(1 + x) at a set of primes S is defined by taking those powers of x in ...
AbstractAn elementary proof is given of the Hasse-Weil theorem about the number of solutions of the ...
AbstractLet p(n) denote the number of unrestricted partitions of n. It is known that p(5m+4), p(7m+5...
AbstractLet |S|=n. The numbers m(n, k)=|{(S1,…,Sk):∪ Si=S and, ∀t∈[1,k], ∪i≠lSi≠S| have been studied...
AbstractIt is shown that if AϵΩn−{Jn} satisfies nkσk(A)⩾(n−k+1)2 σk−1(A) (k=1,2,…,n), where σk(A) de...
AbstractFor a > 0 let ψa(x, y) = ΣaΩ(n), the sum taken over all n, 1 ≤ n ≤ x such that if p is prime...
AbstractWe give an upper bound for some exponential sums over primes, using only sieve methods and C...
AbstractLet k be an integer ≥ 1 and let l be an integer such that 1 ≤ l ≤ k, (l,k) = 1. An asymptoti...
AbstractLet k1 ⩽ k2 ⩽ … ⩽ kn be given positive integers and let F denote the set of vectors (l1, …, ...
AbstractIn this paper we obtain the distribution of the functionω(ϕk(n)) which counts the number of ...
AbstractUsing Kummer's criteria we show that if the first case of Fermat's last theorem fails for th...
AbstractWe prove arithmetically that some quotient of products of factorials in an integer, which ca...
AbstractIf b(m;n) denotes the number of partitions of n into powers of m, then b(m; mr+1n) ≡ b(m; mr...
AbstractWe continue the discussion of the numbers c(G) and r(G) defined in [1]. The following result...
AbstractThe concept of quasi-multiplication is used to describe the theory of polynomial sequences, ...
The localization LS(x) of log(1 + x) at a set of primes S is defined by taking those powers of x in ...
AbstractAn elementary proof is given of the Hasse-Weil theorem about the number of solutions of the ...
AbstractLet p(n) denote the number of unrestricted partitions of n. It is known that p(5m+4), p(7m+5...
AbstractLet |S|=n. The numbers m(n, k)=|{(S1,…,Sk):∪ Si=S and, ∀t∈[1,k], ∪i≠lSi≠S| have been studied...
AbstractIt is shown that if AϵΩn−{Jn} satisfies nkσk(A)⩾(n−k+1)2 σk−1(A) (k=1,2,…,n), where σk(A) de...
AbstractFor a > 0 let ψa(x, y) = ΣaΩ(n), the sum taken over all n, 1 ≤ n ≤ x such that if p is prime...
AbstractWe give an upper bound for some exponential sums over primes, using only sieve methods and C...
AbstractLet k be an integer ≥ 1 and let l be an integer such that 1 ≤ l ≤ k, (l,k) = 1. An asymptoti...
AbstractLet k1 ⩽ k2 ⩽ … ⩽ kn be given positive integers and let F denote the set of vectors (l1, …, ...
AbstractIn this paper we obtain the distribution of the functionω(ϕk(n)) which counts the number of ...
AbstractUsing Kummer's criteria we show that if the first case of Fermat's last theorem fails for th...
AbstractWe prove arithmetically that some quotient of products of factorials in an integer, which ca...
AbstractIf b(m;n) denotes the number of partitions of n into powers of m, then b(m; mr+1n) ≡ b(m; mr...
AbstractWe continue the discussion of the numbers c(G) and r(G) defined in [1]. The following result...
AbstractThe concept of quasi-multiplication is used to describe the theory of polynomial sequences, ...