等比数列的一个判定条件

定理设{an}的各项全为正数,若a12a2+a22a3+…+an-12n=(a1+a2+…+an-1)2a2+a3+…+an,则a1,a2,…,an为等比数列.证令m=(a1a2,a2a3,…,an-1an).n=(a2,a3,…,an).由a12a2+a22a3+…+an-12an=(a1+a2+…+an-1)2a2+a3+…+an得a12a2+a22a3+…+an-12an·a2+a3+…+an=a1+a2+…+an-1.即|m||n|=m·n,所以m与n共线,故存在常数k,使得a2=ka1a2,a3=ka2a3,…,an=kan-1an,∴a2a1=a3a2=…=anan-1=k,从而{an}是等比数列.等比数列的一个判定条件@齐行超$单县二中!山东274300…     

综合题新编选登

题147设数列{an}满足:当n=2k-1(k∈N*)时,an=n;当n=2k(k∈N*)时,an=ak.1)求a2 a4 a6 a8 a10 a12 a14 a16;2)若Sn=a1 a2 a3 … a2n-1 a2n,证明:Sn=4n-1 Sn-1(n≥2);3)证明:S11 S12 … S1n<1-41n.解1)原式=a1 a2 a3 a4 a5 a6 a7 a8=a1 a1 a3 a1 a5 a3 a7 a1=4a1 2a3 a5 a7=4×1 2     

与二项式系数有关的求和问题的解题策略

1赋值求和例1设(2x-3)10=a10(x-1)10 a9(x-1)9 … a2(x-1)2 a1(x-1) a0,求a1 a2 a3 … a10的值.解令x=2,得a0 a1 a2 a3 … a10=1;令x=1,得a0=(-1)10=1,所以a1 a2 a3 … a10=1-1=0.例2设(1 x x2)n=a0 a1x a2x2 … a2nx2n,求a1 a3 a5 … a2n-1的值.解令x=1,得a0 a1 a2 … a2n=3n;令x=-1,得a0-a1 a2-…-a2n-1 a2n=1.两式相减得a1 a3 a5 … a2n-1=3n-12.2逆用定理例3已知等比数列{an}的首项为a1,公比为q,求和:a1C0n a2C1n a3C2n … an 1Cnn.解a1C0n a2C1n a3C2n … an 1Cnn=a1C0n a1qC1n a1q2C2n … a1qnCnn=a1(C0n qC1n q2C2n … qnCnn)…     

等差数列的一个性质

设数列{an}是公差为d的等差数列,且对于n∈N,有an≠0,当d≠0时容易得到以下几个恒等式:1a1a2=1daa21-aa21=1d(a11-a12),1a1a2a3=21daa31a-2aa13.=21d(a11a2-a21a3)=21d[1d(a11-a12)-1d(a12-a13)]=21d2(a11-a22 a13).1a1a2a3a4=31daa1a4-2aa31a4=31d(a1a12a3-a2a13a4)=31d[21d2(a11-a22 a13)-21d2(a12-a23 a14)]=61d3(a11-a32 a33-a14).为了除去d≠0的限制,我们作出如下变形:1a1-a12=a1da2,1a1-a22 a13=a12ad22a3,1a1-a32 a33-a14=a1a62da33a4.显然d=0时,以上三式也是恒成立的,注意到系数与组合数之间的关系,因此以上三式可改写为:C10a1 (-a…     

一道北大自主招生试题的另证

这是2008年北京大学自主招生数学试题第三题: 　　题目已知a1,a2,a3,b1,b2,b3,是非负数,且满足a1+a2+a3=b1+b2+b3,a1a2+a2·a1a3=b1b2+b2b3+b1b3,若min{a1,a2,a3}≤min{b1,b2,b3}. 　　求证:max{a1,a2,a3}≤max{b1,b2,b3}.……     

对一道自创题的引申和总结

题目已知a1 a2 a3=4,b1 b2 b3=3,且a1,a2,a3,b1,b2,b3均为正数,试求a12 b21 a22 b22 a23 b32的最小值.解析初看此题,很容易联想到不等式法,由a12 b12 a22 b22 a23 b32≥a1 b12 a2 2b2 a3 2b3,而得最小值为52.其实这个结果不正确,因为等号取得时应有a1=b1,a2=b2,a3=b3,而a1 a2 a3≠b1 b2 b3,故等号无法取得.图1图2经过尝试,我们发现可以用构造法来解决这个问题.如图1,构造一个长为4,宽为3的矩形,且分别将长和宽分为三份,长度依次为a1,a2,a3和b1,b2,b3,则图中线段AB,BC,CD的长度分别为a12 b12,a22 b22,a32 b23.易知只有当AB,BC,CD共线时,…     

关于素数等差数列的一组结论

文[1]讨论了三个素数成等差数列的问题,给出了三个素数a,a+d,a+2d成等差数列的三个猜想.猜想1设三个数a,a+d,a+2d构成一个等差数列,其中a和d都是正整数.当d是奇数时,不论a取何值,a,a+d,a+2d不可能都是素数.猜想2设三个数a,a+d,a+2d构成一个     

世界各地数学奥林匹克试题摘编

1(2000年俄罗斯数学奥林匹克)求证:存在10个不同的实数a1,a2,…,a10,使得方程(x-a1)(x-a2)…(x-a10)=(x a1)(x a2)…(x a10)(1)恰有5个不同的实根.证取a1,a2,a3,a4,a5为正数,a6=0,并且a7 a8=0,a9 a10=0.下证这样的10个实数满足题设.事实上,对于k∈{6,7,8,9,10},(1)式两边都有因     

2002年全国高中数学联赛山东赛区预赛题解

选择题(每小题6分,共60分) 1.设数列{an}是公比为2的等比数列,且a1·a2……a30=230,则a3·a6……a30等于 ( ) (A)210. (B)215. (C)216. (D)220. 解 令S1=a1·a4·a7……a28, S2=a2·a5·a8……a29, S3=a3·a6·a9……a30,     

一道不等式的推广及证明

文[1]中给出了如下两个不等式及证明:1.设a1,a2,…,am均为正数,且a1 +a2+…+am=ms0,则(a1+1+a1)a+(a2+1/a2)a+…+(am+1/am)a≥m (s0+1/s0)a (m,a∈N*,m≥2)① 2.设a1,a2,…,am均为正数,且a1+a2+…+ am=ms0,若s0≤s≤1或1≤s≤s0,则(a1+1/a1)a+(a2+1/a2)a+…+(am+1/am)a≥m(s+1/s)a(m,a∈N*,m≥2) ②笔者认为当a是大于等于1的实数时,上述不等式也是成立的.     

二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

Toader型平均与几种经典平均的确界

给出了最佳参数α_1,α_2,α_3,β_1,β_2,β_3∈R,使得双向不等式α_1Q(a,b)+(1-α_1)G(a,b)0且a≠b成立.其中A(a,b)=(a+b)/2,H(a,b)=2ab/(a+b),G(a,b)=(ab)~(1/2),Q(a,b)=((a~2+b~2)/2)~(1/2),C(a,b)=(a~2+b~2)/(a+b),T(a,b)=2/π∫_0~(π/2)(a~2cos~2t+b~2sin~2)~(1/2)tdt分别是两个正数a和b的算术平均,调和平均,几何平均,二次平均,反调和平均和Toader平均.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

On arithmetic Macaulayfication of Noetherian rings

The Rees algebra is the homogeneous coordinate ring of a blowing-up. The present paper gives a necessary and sufficient condition for a Noetherian local ring to have a Cohen-Macaulay Rees algebra: A Noetherian local ring has a Cohen-Macaulay Rees algebra if and only if it is unmixed and all the formal fibers of it are Cohen-Macaulay. As a consequence of it, we characterize a homomorphic image of a Cohen-Macaulay local ring. For non-local rings, this paper gives only a sufficient condition. By using it, however, we obtain the affirmative answer to Sharp's conjecture. That is, a Noetherian ring having a dualizing complex is a homomorphic image of a finite-dimensional Gorenstein ring.

     

Global efficiency in multiobjective programming *

In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed     

Galois环上本原序列压缩映射的单性

设Ω是 Ｇａｌｏｉｓ环 ＧＲ（２~ｄ,ｒ）的 Ｔｅｉｃｈｍｕｌｌｅｒ代表集,则 ＧＲ（２~ｄ,ｒ）上每条序列ａ有唯一的权位分解,　其中ａ-ｉ是Ω上序列,同时也可自然视为有限域Ｆ-（２~ｒ）,上序列．设ｆ（ｘ）是环 ＧＲ（２~ｄ,ｒ）上强本原多项式,Ｇ（ｆ（ｘ））表示 ＧＲ（２~ｄ,ｒ）上以ｆ（ｘ）为特征多项式的序列的全体,是Ｆ-（２~ｒ）上一类ｄ－１元多项式, 　本文证明了压缩映射是单射,即对 ａ＝ ｂ当且仅当对所有 ａ,ｂ ∈ Ｇ（ｆ（ｘ））．     

On a Mathematical Comparison between Hierarchy and Network with a Classification of Coordination Structures

This paper proposes a mathematical model to compare a network organization with a hierarchical organization. In order to formulate the model, we define a three-dimensional framework of the coordination structure of a network and of other typical coordination structures. In the framework, we can define a network structure by contrasting it with a hierarchy, in terms of the distribution of decision making, which is one of the main features of information processing. Based on this definition, we have developed a mathematical model for evaluating coordination structures. Using this model, we can derive two boundary conditions among the coordination structures with respect to the optimal coordination structure. The boundary conditions help us to understand why an organization changes its coordination structure from a hierarchy to a network and what factors cause this change. They enable us, for example, to find points of structural change where the optimal coordination structure shifts from a hierarchy to a hierarchy with delegation or from a hierarchy with delegation to a network, when the nature of the task changes from routine to non-routine. In conclusion, our framework and model may provide a basis for discussing the processes that occur when coordination structures change between a hierarchy and a network.     

Slice theorem and orbit type stratification in infinite dimensions

We establish a general slice theorem for the action of a locally convex Lie group on a locally convex manifold, which generalizes the classical slice theorem of Palais to infinite dimensions. We discuss two important settings under which the assumptions of this theorem are fulfilled. First, using Glöckner's inverse function theorem, we show that the linear action of a compact Lie group on a Fréchet space admits a slice. Second, using the Nash–Moser theorem, we establish a slice theorem for the tame action of a tame Fréchet Lie group on a tame Fréchet manifold. For this purpose, we develop the concept of a graded Riemannian metric, which allows the construction of a path-length metric compatible with the manifold topology and of a local addition. Finally, generalizing a classical result in finite dimensions, we prove that the existence of a slice implies that the decomposition of the manifold into orbit types of the group action is a stratification.     

Unified approach to some geometric results in variational analysis

Based on a study of a minimization problem, we present the following results applicable to possibly nonconvex sets in a Banach space: an approximate projection result, an extended extremal principle, a nonconvex separation theorem, a generalized Bishop-Phelps theorem and a separable point result. The classical result of Dieudonné (on separation of two convex sets in a finite-dimensional space) is also extended to a nonconvex setting.