关于k√n的不等式猜想的再研讨

文[1]给出了一个关于k√n的不等式猜想，文[2]指出该猜想的右侧不等式，即对于正整数n，k〉1，不等式k√n〈kn＋（k-1）/k＋1k√n-k（n-1）＋（k-1）/k＋1k√n-1在k=2时不成立，当k〉2时成立．本文研究了该猜想的左侧不等式，对于正整数n，k〉1，不等式     

关于对称平均数定理及其应用

我们把n个正数α_1,α_2,…,α_n的k次对称平均数定义为其中k≤n为正整数;根号内分子部分是n个正数每次不重复地取k个的乘积之和,共有C_n~k项。为简单计,我们把(1)记为∑_n~k(α_1,α_2,…α_n),或者有时就记为∑_n~k。显然, ∑_n~1(α_1,α_2,…α_n)=(α_1 α_2 ……α_n)/n即为n个正数的算术平均数,而∑_n~n(α_1,α_2,…α_n)=则是n个正数的几何平均数。本文先介绍有关n个正数的k次对称平均数的重要性质的两个定理,然后给出它的一些应用。首先,我们证明定理1.(∑_n~k)~(?)k≥(∑_n~(k 1))~(k 1)·(∑_n~(k-1))~(k-1)(k=1,2,…,n-1) (这里规定∑_n~0=1)。证明.为书写方便,记(∑_n~k)~k=P_n~k。因而我们要证明的就是 (P_n~k)~2≥P_n~(k 1)·P_n~(k-1)(P_n~0=1,k=1,2,…n-1)     

小区间上的素变数三角和估计

设A(n)为von Mangoldt函数且实数θ=95-83~(1/2)/121.当xθ+ε≤y≤x时,本文对于所有的α∈[0,1]给出了指数和S2(x,y;α)=∑x0,估计式∑x相似文献   

一个不等式猜想的证明

对于正数ai>0,i=1,2,…,n,k为给定的正整数,若∑ni=1ai=1,笔者在文[1]末提出了猜想:∏n-1i=1(1∑kj=1ai j-∑nj=k 1ai j)≥(nk kn-1)n(1)其中an i=ai(i=1,2,…,n-1),k为常数,且0相似文献   

一道竞赛题的解答及推广

问题 证明:对任意正整数n,2n/3n+1≤3n∑k=n+1 1/k≤3n+1/4(n+1)成立.(2001年爱尔兰数学奥林匹克试题).     

On Kantorovich-Stieltjes operators

Let ν be a finite Borel measure on[0,1]The Kantorovich-Stieltjes polynomials are de-fined byK_n ν=(n+1)N_(k,n)(nN),where N_(k,n)(x)=x~k(1-x)~(n-k)(x[0,1],k=1,2,…,n)are the basic Bernsteinpolynomials and I_(k,n):=[k/(n+1),(k+1)/(n+1)](k=0,1,…,n;nN).We prove that the maximaloperator of the sequence(K_n)is of weak type and the sequence of polynomials(K_n ν)con-verges a.e.on[0,1]to the Radon-Nikodym derivative of the absolutely continuous part of     

n元三次多项式不等式猜想的证明

猜想 [1]　设 x1,x2 ,… ,xn∈ R+ ,n为正整数 ,证明或否定 :n( n - 1 ) ∑ni=1x3 i + ( ∑ni=1xi) 3　≥ ( 2 n - 1 ) ∑ni=1xi∑ni=1x2i ( 1 )这是杨学枝老师近日提出的一个猜想 .经探讨发现 ,此猜想成立 .为证明 ( 1 )式成立 ,先给出如下引理 .引理 1　 x1,x2 ,… ,xn∈ R,n为正整数 ,则( ∑ni=1xi) 3 =∑ni=1x3 i + 3∑i≠ jx2ixj+ 6 ∑1≤ i相似文献   

一个最值问题的求解方法

文[1 ] 对如下问题进行了研究 :已知实数x1 ,x2 ,… ,xn 满足x21 +x22 +… +x2 n= 1 ,当n≥ 3时 ,求maxi≠j mini≠j|xi-xj|.本文给出如下简捷解法 .由题意 ,不妨设x1 ≤x2 ≤…≤xn -1 ≤xn,并令mini≠j|xi-xj|=min|xi+ 1 -xi|=a(i=1 ,2 ,… ,n - 1 ) .则当 j>i时 ,xj-xi=(xj-xj-1 ) +… +(xi+ 1 -xi)≥(j-i)a∴ ∑1≤i相似文献   

含全部k-排列的数列的最小长度

设 F(n,k)为由1,2,…,n 组成的数列 S_(n,k)的最小长度,S_(n,k)满足对每个自然数 i≤k,它的前 F(n,i)项含1,2…,n 的全部 i-排列.本文证明,F(n,k)≤k(n-1)+1-[(K+2)/6]-[K/6]-[(K-2/6)]并猜想,这是最好结果.     

半群O_n(k)的秩

设O_n是有限链[n]上的保序变换半群.对任意1≤k≤n-1,研究半群O_n(k)={α∈O_n:(x∈[n]x≤k→xα≤k}的秩和幂等元秩,证明了半群O_n(k)的秩为2n-3.进一步,得到了半群O_n(k)(2≤k≤n-1)的幂等元秩为n和半群O_n(1)的幂等元秩为n-1.     

Determining a Rotation of a Tetrahedron from a Projection

The following problem, arising from medical imaging, is addressed: Suppose that T is a known tetrahedron in ?³ with centroid at the origin. Also known is the orthogonal projection U of the vertices of the image ?T of T under an unknown rotation ? about the origin. Under what circumstances can ? be determined from T and U?     

On a mapping of a projective space into a sphere

We obtain an exact estimate for the minimum multiplicity of a continuous finite-to-one mapping of a projective space into a sphere for all dimensions. For finite-to-one mappings of a projective space into a Euclidean space, we obtain an exact estimate for this multiplicity for n = 2, 3. For n ≥ 4, we prove that this estimate does not exceed 4. Several open questions are formulated.     

Calculating a function of a matrix with a real spectrum

Let T be a square matrix with a real spectrum, and let f be an analytic function. The problem of the approximate calculation of f(T) is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that T is triangular and its diagonal entries t_ii are arranged in increasing order. To avoid calculations using the differences t_ii ? t_jj with close (including equal) t_ii and t_jj, it is proposed to represent T in a block form and calculate the two main block diagonals using interpolating polynomials. The rest of the f(T) entries can be calculated using the Parlett recurrence algorithm. It is also proposed to perform some scalar operations (such as the building of interpolating polynomials) with an enlarged number of significant decimal digits.

     

Evolution to a steady state for a rarefied gas flowing from a tank into a vacuum through a plane channel

A kinetic equation (S-model) is used to solve the nonstationary problem of a monatomic rarefied gas flowing from a tank of infinite capacity into a vacuum through a long plane channel. Initially, the gas is at rest and is separated from the vacuum by a barrier. The temperature of the channel walls is kept constant. The flow is found to evolve to a steady state. The time required for reaching a steady state is examined depending on the channel length and the degree of gas rarefaction. The kinetic equation is solved numerically by applying a conservative explicit finite-difference scheme that is firstorder accurate in time and second-order accurate in space. An approximate law is proposed for the asymptotic behavior of the solution at long times when the evolution to a steady state becomes a diffusion process.