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

这是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}.……     

一道不等式的推广及证明

文[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的实数时,上述不等式也是成立的.     

由√a2=｜a｜想到的

由绝对值的定义,公式√a2=｜a｜可表示为√a2=｜a｜=a a≥0,-a a〈0.这里a可表示一个数,也可以表一个式子.     

北大保送试题与代数基本定理

题目 已知f(x)是二次函数,且a,f(a),f(f(a)),f(f(f(a)))构成正项等比数列,求证:f(a)=a. 证明:设f(a)=qa(q＞0),则f(f(a))=q2a,即f(qa)=q2a;同理有f(q2a)=q3a.     

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

文[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．一道竞赛题的简证 2008年湖南省高中数学竞赛有这样一道试题： 问题1：设实数a,b∈[a,β],求证：b/a＋a/b≤β/a＋a/β,其中等号当且仅当a=a，b=β或a=β,b=a成立，a,β为正实数。     

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

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面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)相离.     

一道“希望杯”竞赛题的研究

题目（第二十一届“希望杯”高二第2试）已知a,b∈R＋,且ab=2,则b/2＋a2＋a/2＋b2的最小值是.本文从两个角度对问题进行研究,先对问题作一题多解,然后对问题作多方面变式,供大家参考.1.一题多解解法1∵a,b∈R＋,且ab=2,∴b=2/a,∴b/2＋a2＋a/2＋b2=2/a2＋a2＋a/2＋4/a2=2/a（2＋a2）＋a3/2（2＋a2）=4＋a4/2a（2＋a2）,     

为什么有不同的结果

问题:已知数列{an}满足a1=51,an+an+1=54n+1,求lni→m∞(a1+a2+a3+…+an)的值.(2004年高考湖南第8题)方法(1):a1+a2+a3+…+an+…=(a1+a2)+(a3+a4)+(a5+a6)+…=542+544+546+…=1-542512=61.方法(2):a1+a2+a3+…+an+…=21[a1+(a1+a2)+(a2+a3)+(a3+a4)+(a4+a5)+…]=2151+542+543+543+…=51方法(3):由an+an+1=54n+1,an+1+an+2=54n+2,两式相减得,an-an+2=51n6+2=51n6+2=1256·51n,利用a1-a3=1256·51,a3-a5=1265·513,a5-a7=1256·515,…,a2n-1-a2n+1=1256·521n-1,以上n个等式全部相加得,a1-a2n+1=215615+513+…+521n-1=1251-512n,所以a2n+1=115…     

一道高考不等式试题的简证

2010年高考数学江苏卷理科附加题第21(D)题: 设a,b是非负实数,求证:a3+b3≥√ab(a2+b2).证明因2(a3+b3)-(a+b)(a2+b2)=a(a2-b2)+b(b2-a2)=(a+b)(a-b)2≥0,故a3+b3≥a+b/2(a2+b2)≥√ab(a2+b2).本文其实证明了原不等式的一个加强: 设a,b是非负实数,求证:a3+b3≥a+b/2(a2+b2).     

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.     

Staircase Parameterization in Dynamical Selection

This paper deals with a variant of a dynamical selection scheme introduced by Attouch and Cominetti for ill-posed convex minimization which combines approximation with the steepest descent method by mean of a suitable parameterization of the approximation parameter as a function of the time. This variant applies to a general inclusion with a maximal monotone operator by mean of a staircase parameterization. A discrete analogue is also considered. Applications to selecting a particular zero of a maximal monotone operator or a particular fixed point of a nonexpansive mapping via regularization techniques are presented. Finally, the alternative use of well-posedness by perturbations is discussed.     

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.

     

An algorithm for constructing star-shaped drawings of plane graphs

A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304–320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43–69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing.In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing.     

Box-Rectangular Drawings of Plane Graphs

In this paper we introduce a new drawing style of a plane graph G called a box-rectangular drawing. It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, and the contour of each face is drawn as a rectangle. We establish a necessary and sufficient condition for the existence of a box-rectangular drawing of G. We also give a linear-time algorithm to find a box-rectangular drawing of G if it exists.     

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     

Two questions on semi-clean group rings

It was proved in [4] that every group ring of a torsion abelian group over a commutative local ring is a semi-clean ring. It was asked in [4] whether every group ring of a torsion abelian group over a commutative clean ring is a semi-clean ring and whether every group ring of a torsion abelian group over a commutative semi-clean ring is a semi-clean ring. In this paper, we give a positive answer to question 1 and a negative answer to question 2.     

A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints

In this paper a barrier function method is proposed for approximating a solution of the nonconvex quadratic programming problem with box constraints. The method attempts to produce a solution of good quality by following a path as the barrier parameter decreases from a sufficiently large positive number. For a given value of the barrier parameter, the method searches for a minimum point of the barrier function in a descent direction, which has a desired property that the box constraints are always satisfied automatically if the step length is a number between zero and one. When all the diagonal entries of the objective function are negative, the method converges to at least a local minimum point of the problem if it yields a local minimum point of the barrier function for a sequence of decreasing values of the barrier parameter with zero limit. Numerical results show that the method always generates a global or near global minimum point as the barrier parameter decreases at a sufficiently slow pace.