等比数列的一个性质

设｛ａｎ｝是以ｑ为公比的等比数列,其前ｎ项和为Ｓｎ,若１≤ｍ＜ｎ,则易知　Ｓｎ＝Ｓｍ＋ｑｍＳｎ－ｍ．（１）特别地,当ｍ＝１而ｎ＞１时,有　　　　　Ｓｎ＝ａ１＋ｑＳｎ－１．（２）这是等比数列的一个简单性质,容易推出其逆命题也成立．下面举两例说明（１）和（２）的应用．例１　设｛ａｎ｝为等比数列,公比为ｑ,前ｎ项和为Ｓｎ．（Ⅰ）若对任何ｉ＝１,２,…,ｍ,有｜Ｓｉ｜≤Ｍ（常数）,则对任何ｉ＝１,２,…,２ｍ,有｜Ｓｉ｜≤（１＋｜ｑ｜ｍ）Ｍ．（Ⅱ）若对任何ｉ＝１,２,…,ｍ,有｜Ｓｉ｜≤Ｍ且｜ｑ｜＜１,…     

独立随机变量序列重对数律的一个注记

｛Ｘ_ｉ｝为独立随机变量序列,Ｅ（Ｘ_ｉ）＜＋∞,Ｅ（Ｘ (２)_(ｉ)）＜＋∞（ｉ＝１,２,…）,当中心极限定理中的余项△ｎ＝Ｏ（ｌｎ Ｂｎｌｎ ｌｎ Ｂｎ…（ｌｎｋ　Ｂｎ）~（１＋δ）~（－１））时,本文得出结论：     

复合等差(比)数列的通项公式及其应用

我们看两类函数（１）｛ａｆ（ｎ）｝　（ｎ＝１,２,…）（２）｛ｆ（ａｎ）｝　（ｎ＝１,２,…）如果数列（１）、（２）是等差（比）数列,那么我们把它们称为复合等差（比）数列．于是,ａｆ（ｎ）＝ａｆ（１）＋（ｎ－１）ｄ或ａｆ（ｎ）＝ａｆ（１）ｑｎ－１．例１　数列｛ａｎ｝满足２Ｓ２ｎ＝２ａｎＳｎ－ａｎ（ｎ≥２）,ａ１＝２,求ａｎ及Ｓｎ．解　将ａｎ＝Ｓｎ－Ｓｎ－１（ｎ≥１）代入等式,得　　　　２ＳｎＳｎ－１＝Ｓｎ－１－Ｓｎ．因为ａ１＝２≠０,故Ｓｎ≠０,上式可变为１Ｓｎ－１Ｓｎ－１＝２,∴　数列｛１Ｓｎ…     

巧构函数解一类三角问题

定理设ｆ（ｘ）＝ａ１ｓｉｎ（ｘ＋α１）＋ａ２ｓｉｎ（ｘ＋α２）＋…＋ａｎｓｉｎ（ｘ＋αｎ）（或ｆ（ｘ）＝ａ１ｃｏｓ（ｘ＋α１）＋ａ２ｃｏｓ（ｘ＋α２）＋…＋ａｎｃｏｓ（ｘ＋αｎ））（ａｉ,αｉ是常量,ｉ＝１,２,…,ｎ）．如果对ｘ１,ｘ２（ｘ１－ｘ２...     

自然数分数幂数列近似求和初探

自然数方幂求和问题：即Ｓｐ＝１ｐ＋２ｐ＋…＋ｎｐ求和,两千多年来,为人们关注和熟知．三百多年前,贝努利用二项式定理及递归方法,对每个自然数ｐ,可逐个求出Ｓｐ．今天,Ｓｐ的求法仍在不断被改进、创新．这在许多著作及刊物中均可找到．我们知道：ｐ＜－１时,Ｓｐ收敛．例如熟知　ｌｉｍｎ→∞（１１２＋１２２＋…＋１ｎ２）＝π２６．当ｐ≥－１时,Ｓｐ发散．（ｐ＝－１时Ｓｐ＝１１＋１２＋…＋１ｎ,即调和级数,可用递归型公式求和）．当ｐ为非负整数时,熟知Ｓ０＝ｎ,Ｓ１＝ｎ（ｎ＋１）２,Ｓ２＝１６ｎ（ｎ＋１）（２ｎ…     

两类数列变换在解题中的应用

利用数列｛ａｎ｝的如下两类变换：ａｎ＝ａ１＋（ａ２－ａ１）＋（ａ３－ａ２）＋…＋（ａｎ－ａｎ－１）及ａｎ＝ａ１ａ２ａ１ａ３ａ２…ａｎａｎ－１（ａｉ≠０,ｉ＝１,２,…,ｎ－１）不仅能简便地推导出等差数列和等比数列的通项公式,而且灵活运用它们还能简捷、...     

一个代数不等式的推广

文［１］将Ｐｏｐｏｖｉｃｉｕ不等式修正为：“设ｘｉ,ｙｉ≥０（ｉ＝１,２,…,ｎ）,且ｘｐ１－∑ｎｉ＝２ｘｐｉ＞０和ｙｐ１－∑ｎｉ＝２ｙｐｉ＞０,其中０＜ｐ≤２,则（ｘｐ１－∑ｎｉ＝２ｘｐｉ）（ｙｐ１－∑ｎｉ＝２ｙｐｉ）≤（ｘ１ｙ１－∑ｎｉ＝２ｘｉｙｉ）ｐ①当且仅当ｐ＝２且ｘ１ｙ１＝ｘ２ｙ２＝…＝ｘｎｙｎ时,①式取等号”．这里,应加上“当０＜ｐ≤２,ｘ２＝ｘ３＝…＝ｘｎ＝ｙ２＝ｙ３＝…＝ｙｎ＝０时,①也取等号”才完整．本文我们将不等式①进一步推广为：定理　设ｘｉｊ＞０（ｉ＝１,２,…,ｍ,ｊ＝１…     

两个不等式的简捷证法

下面给出的两类不等式问题,一般是通过代换的方法证明．本文给出直接简捷的证明．命题１　设ｘｉ∈Ｒ＋（ｉ＝１,２,…,ｎ）且ｘ２１１＋ｘ２１＋ｘ２２１＋ｘ２２＋…＋ｘ２ｎ１＋ｘ２ｎ＝ａ（０＜ａ＜ｎ）,求证：ｘ１１＋ｘ２＋ｘ２２１＋ｘ２２＋…＋ｘ２ｎ１＋ｘ２ｎ≤ａ（ｎ－ａ）①证　由题设易知：１１＋ｘ２１＋１１＋ｘ２２＋…＋１１＋ｘ２ｎ＝ｎ－ａ．由于　１１＋ｘ２ｋ＋ｎ－ａａ·ｘ２ｋ１＋ｘ２ｋ　　≥２１１＋ｘ２ｋ·ｎ－ａａ·ｘ２ｋ１＋ｋ２ｋ　　＝２ｎ－ａａ·ｘｋ１＋ｘ２ｋ）（ｋ＝１,２,…,ｎ）,此ｎ式相…     

关于一个单形不等式的简单证明

关于一个单形不等式的简单证明杨定华（重庆师范学院数学系，重庆４０００４７）苏化明先生在文［１］建立如下与ｎ维单形外接超球心有关的一个不等式：定理设Ａ＝Ａ１Ａ２…Ａｎ＋１为Ｅｎ中的ｎ维单形，Ａ的外接超球心Ｏ位于其内部．记Ａｉ＝Ａ１Ａ２…Ａｉ－１ＯＡｉ＋...     

不等式研究成果集锦(2)

１３．设ｓ、ｔ是两个非零实数,对正整数ｒ＝１,２,…,ｎ－１,定义ｎ元正实数组ａ＝（ａ１,ａ２,…,ａｎ）和正权数组λ＝（λ１,λ２,…,λｎ）的一类加权对称平均　Ｐｒ（ａ,λ;ｓ,ｔ）＝∑１≤ｉ１＜…＜ｉｒ≤ｎ（∑ｎｋ＝１λｎ－∑ｒｊ＝１λｉｊ）（ｒ－１∑ｒｊ＝１ａｓｉｊ）ｔｓＣｒｎ－１∑ｎｋ＝１λｋ１ｔ,则对ｒ＝１,２,…,ｎ－２,当ｓ＜ｔ时,有Ｐｒ（ｒ,λ;ｓ,ｔ）≥Ｐｒ＋１（ｒ,λ;ｓ,ｔ）;当ｓ＞ｔ时,上边不等式反号．（张志华,肖振纲,１９９８,３）１４．△ＡＢＣ三边长分别为ａ、ｂ、ｃ…     

The apollonian octets and an inversive form of Krause's theorem

Suppose we are given three disjoint circles in the Euclidean plane with the property that none of them contains the other two. Then there are eight distinct circles tangent to the given three, and R.M. Krause has shown that a certain alternating sum of the curvatures of these eight circles must vanish. We express this result in an inversively invariant way and determine the extent to which it generalizes to other configurations of three given circles.     

The Envelope of Lines Meeting a Fixed Line and Tangent to Two Spheres

We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also meet the given line. All such configurations are degenerate. The path to this result involves the interplay of some beautiful and intricate geometry of real surfaces in 3-space, complex projective algebraic geometry, explicit computation and graphics.     

3D extension of Steiner chains problem

A natural 3D extension of the Steiner chains problem, original to the authors of this article, where circles are substituted by spheres, is presented. Given three spheres such that either two of them are contained in (or intersect) the third one, chains of spheres, each one externally tangent to its two neighbors in the chain and to the first and second given spheres, and internally tangent to the third given sphere, are considered. A condition for these chains to be closed has been stated and the Steiner alternative or Steiner porism has been extended to 3D. Remarkably, the process is of symbolic-numeric nature. Using a computer algebra system is almost a must, because a theorem in the constructive theory in the background requires using the explicit general solution of a non-linear algebraic system. However, obtaining a particular solution requires computing concatenated processes involving trigonometric expressions. In this case, it is recommended to use approximated calculations to avoid obtaining huge expressions.     

A generalized Malfatti problem

Malfatti?s problem, first published in 1803, is commonly understood to ask fitting three circles into a given triangle such that they are tangent to each other, externally, and such that each circle is tangent to a pair of the triangle?s sides. There are many solutions based on geometric constructions, as well as generalizations in which the triangle sides are assumed to be circle arcs. A generalization that asks to fit six circles into the triangle, tangent to each other and to the triangle sides, has been considered a good example of a problem that requires sophisticated numerical iteration to solve by computer. We analyze this problem and show how to solve it quickly.     

Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings

Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. Such packings can be described in terms of the Descartes configurations they contain, where a Descartes configuration is a set of four mutually tangent circles in the Riemann sphere, having disjoint interiors. Part I showed there exists a discrete group, the Apollonian group, acting on a parameter space of (ordered, oriented) Descartes configurations, such that the Descartes configurations in a packing formed an orbit under the action of this group. It is observed there exist infinitely many types of integral Apollonian packings in which all circles had integer curvatures, with the integral structure being related to the integral nature of the Apollonian group. Here we consider the action of a larger discrete group, the super-Apollonian group, also having an integral structure, whose orbits describe the Descartes quadruples of a geometric object we call a super-packing. The circles in a super-packing never cross each other but are nested to an arbitrary depth. Certain Apollonian packings and super-packings are strongly integral in the sense that the curvatures of all circles are integral and the curvature x centers of all circles are integral. We show that (up to scale) there are exactly eight different (geometric) strongly integral super-packings, and that each contains a copy of every integral Apollonian circle packing (also up to scale). We show that the super-Apollonian group has finite volume in the group of all automorphisms of the parameter space of Descartes configurations, which is isomorphic to the Lorentz group O(3, 1).     

A note on a problem of Apollonius

Degenerate cases of the problem of Apollonius, to construct a circle tangent to each of three given circles, are discussed and exhaustively classified for proper circles (finite and non-zero radius). Singular cases are considered, and an outline of the extension of the problem to higher dimensions given. Amusing alternative interpretations of the results are obtained.     

Irreducible Apollonian Configurations and Packings

An Apollonian configuration of circles is a collection of circles in the plane with disjoint interiors such that the complement of the interiors of the circles consists of curvilinear triangles. One well-studied method of forming an Apollonian configuration is to start with three mutually tangent circles and fill a curvilinear triangle with a new circle, then repeat with each newly created curvilinear triangle. More generally, we can start with three mutually tangent circles and a rule (or rules) for how to fill a curvilinear triangle with circles.     

Constructions of Solutions to Generalized Sylvester and Fermat–Torricelli Problems for Euclidean Balls

The classical problem of Apollonius is to construct circles that are tangent to three given circles in the plane. This problem was posed by Apollonius of Perga in his work “Tangencies.” The Sylvester problem, which was introduced by the English mathematician J.J. Sylvester, asks for the smallest circle that encloses a finite collection of points in the plane. In this paper, we study the following generalized version of the Sylvester problem and its connection to the problem of Apollonius: given two finite collections of Euclidean balls, find the smallest Euclidean ball that encloses all the balls in the first collection and intersects all the balls in the second collection. We also study a generalized version of the Fermat–Torricelli problem stated as follows: given two finite collections of Euclidean balls, find a point that minimizes the sum of the farthest distances to the balls in the first collection and shortest distances to the balls in the second collection.     

Zur Möbiusgeometrie der Berührkreisscharen

Making use of an earlier result of the theory of stripes in three-dimensional conformal spaceM ₃ we obtain a moving frame and derivational formulas for one-parameter families of tangent circles inM ₃. Avoiding invariant parameters we can set up a bijection of the tangent circles into the osculating circles that preserves the duple ratio. The following section deals with loxodromes on Dupin cyclides. Finally with the aid of a modified stereographic projection we show how to get the Frenet formulas of the euclidian theory of spacecurves from the derivational formulas for tangent circles inM ₃.     

Lines Tangent to Four Unit Spheres with Coplanar Centres

We prove that there are at most eight lines tangent to four unit spheres in \R ³ if the centres of the spheres are coplanar, but not collinear. This bound is sharp. Received October 9, 2000, and in revised form April 26, 2001. Online publication October 12, 2001.