AbstractAsymptotic results, similar to those of Roth and Szekeres, are obtained for certain partition problems. These results are then applied to the distribution of integers of the form p1d1p2d2 … prdr, where d1 ≥ d2 ≥ … ≥ dr, pi denotes the ith prime and r is arbitrary. The saddle-point method is used to obtain the asymptotic results
Our main results are asymptotic zero-one laws satisfied by the diagrams of unimodal sequences of pos...
A partition of [1, n] = {1,..., n} is called irreducible if no proper subinterval of [1, n] is a uni...
Paper presented at Strathmore International Math Research Conference on July 23 - 27, 201
AbstractAsymptotic expansions, similar to those of Roth and Szekeres, are obtained for the number of...
AbstractAsymptotic results, similar to those of Roth and Szekeres, are obtained for certain partitio...
AbstractAsymptotic results are obtained for pA(k)(n), the kth difference of the function pA(n) which...
AbstractWinkler has proved that, if n and m are positive integers with n ≤ m ≤ n25 and m ≡ n (mod 2)...
Using the Saddle point method and multiseries expansions, we obtain from the exponential formula and...
In this paper, we discuss P(n), the number of ways a given integer n may be written as a sum of prim...
Let PK, L(N) be the number of unordered partitions of a positive integer N into K or fewer positive ...
A partition of a positive integer n is a way of writing it as the sum of positive integers without r...
Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later ...
For k 1, denote by p k (n) the number of partitions of an integer n into k-th powers. In this note, ...
AbstractSzekeres proved, using complex analysis, an asymptotic formula for the number of partitions ...
AbstractSuppose Λ = {λ1, λ2, …} is a given set of real numbers such that 0 < λ1 < λ2 < …. Let n(u) =...
Our main results are asymptotic zero-one laws satisfied by the diagrams of unimodal sequences of pos...
A partition of [1, n] = {1,..., n} is called irreducible if no proper subinterval of [1, n] is a uni...
Paper presented at Strathmore International Math Research Conference on July 23 - 27, 201
AbstractAsymptotic expansions, similar to those of Roth and Szekeres, are obtained for the number of...
AbstractAsymptotic results, similar to those of Roth and Szekeres, are obtained for certain partitio...
AbstractAsymptotic results are obtained for pA(k)(n), the kth difference of the function pA(n) which...
AbstractWinkler has proved that, if n and m are positive integers with n ≤ m ≤ n25 and m ≡ n (mod 2)...
Using the Saddle point method and multiseries expansions, we obtain from the exponential formula and...
In this paper, we discuss P(n), the number of ways a given integer n may be written as a sum of prim...
Let PK, L(N) be the number of unordered partitions of a positive integer N into K or fewer positive ...
A partition of a positive integer n is a way of writing it as the sum of positive integers without r...
Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later ...
For k 1, denote by p k (n) the number of partitions of an integer n into k-th powers. In this note, ...
AbstractSzekeres proved, using complex analysis, an asymptotic formula for the number of partitions ...
AbstractSuppose Λ = {λ1, λ2, …} is a given set of real numbers such that 0 < λ1 < λ2 < …. Let n(u) =...
Our main results are asymptotic zero-one laws satisfied by the diagrams of unimodal sequences of pos...
A partition of [1, n] = {1,..., n} is called irreducible if no proper subinterval of [1, n] is a uni...
Paper presented at Strathmore International Math Research Conference on July 23 - 27, 201