搜索结果: 1-10 共查到“应用数学 sum”相关记录10条 . 查询时间(0.046 秒)
On the asymptotic expansion of the sum of the first n primes
asymptotic expansion sum the first n primes
2010/11/12
An asymptotic formula for the sum of the first n primes is derived. This result improves the previous results of P. Dusart. Using this asymptotic expansion, we prove the conjectures of R. Mandl and G...
Let G = (V,E) be a graph with p vertices an q edges. A graph G is said to admit a triangular sum labeling if its vertices can be labeled by non-negative integers such that induced edge labels obtained...
We transform the problem of finding the sum of powers of integers into a geo-
metrical problem. For this, units are represented by unit cubes in n-dimensional
Euclidean spaces and the sums are found...
Inequalities Between the Sum of Squares and the Exponential of Sum of a Nonnegative Sequence
Inequality Sum of square Exponential of sum Nonnegative sequence Critical point Extremal point Open problem
2008/7/1
Inequalities Between the Sum of Squares and the Exponential of Sum of a Nonnegative Sequence.
Inequalities for a Sum of Exponential Functions
Inequality Exponential functions Delay equation
2008/7/1
Inequalities for a Sum of Exponential Functions.
On Schur-Convexity of Expectation of Weighted Sum of Random Variables with Applications
Schur-convex function Optimisation Sum of weighted random variables
2008/6/27
We show that the expectation of a class of functions of the sum of weighted identically independent distributed positive random variables is Schur-concave with respect to the weights. Furthermore, we ...
On the Maximum Row and Column Sum Norm of GCD and Related Matrices
GCD matrix LCM matrix Smith's determinant Maximum row sum norm Maximum column sum norm $O$-estimate
2008/6/27
On the Maximum Row and Column Sum Norm of GCD and Related Matrices.
Absolute bounds on the mean of sum, product, max, and min: A probabilistic extension of interval arithmetic
interval computations partial information about probabilities
2010/9/15
Absolute bounds on the mean of sum, product, max, and min: A probabilistic extension of interval arithmetic.
A graph g is k-ordered Hamiltonian, 2 ≤ k ≤ n, if for every ordered sequence S of k distinct vertices of G, there exists a Hamiltonian cycle that encounters S in the given order. In this article, we p...
本文给出方程n＝3时分别正好存在1个闭解，3个闭解，以及至少存在2个闭解的充分条件，并研究了这些闭解的稳定性．当n＝4且ai（t）（i＝0，1，2，3）为t的P次多项式时，文[1]曾猜想其时闭解重数的上界为max｛4，p＋3｝．本文举例指出，即使p＝3，闭解重数的上界也可以大于7．这