1999年全国高中数学联合竞赛试题及参考答案

一、选择题１．给定公比为ｑ（ｑ≠１）的等比数列｛ａｎ｝,设ｂ１＝ａ１＋ａ２＋ａ３,ｂ２＝ａ４＋ａ５＋ａ６,…,ｂｎ＝ａ３ｎ－２＋ａ３ｎ－１＋ａ３ｎ,…,则数列｛ｂｎ｝（　　）．　（Ａ）是等差数列　　（Ｂ）是公比为ｑ的等比数列　（Ｃ）是公比为ｑ３的等比数列　（Ｄ）既非等差数列又非等比数列解　由题设,ａｎ＝ａ１ｑｎ－１,则　ｂｎ＋１ｂｎ＝ａ３ｎ＋１＋ａ３ｎ＋２＋ａ３ｎ＋３ａ３ｎ－２＋ａ３ｎ－１＋ａ３ｎ＝ａ１ｑ３ｎ＋ａ１ｑ３ｎ＋１＋ａ１ｑ３ｎ＋２ａ１ｑ３ｎ－３＋ａ１ｑ３ｎ－２＋ａ１ｑ３ｎ－１＝ａ１ｑ３…     

一类解析函数族的极值点与支撑点

设Ｇ＝｛ｆ（ｚ）：ｆ（ｚ）在│ｚ│〈１上解析，ｆ（ｚ）＝ｚ－Σｎ＝２→∞ ａｎｚ＾ｎ，ａｎ≥０，Σｎ＝２→∞ ｎａｎ≤１，Σｎ＝３→∞ｎ（ｎ－１）ａｎ≤２ａ２｝。本文找出了函数族Ｇ的极值点与支撑点。     

对称本原有向图的广义本原指数集

本文证明了全体ｎ阶对称本原有向图的第ｋ个第一类（１≤ｋ＜ｎ－１）、第二类（１≤ｋ≤ｎ－１）和第三类（２≤ｋ≤ｎ－１）广义本原指数的指数集分别是｛１，２，…，ｎ－２＋ｋ｝和｛１，２，…，２（ｎ－ｋ）｝，其中「ａ］表不小于ａ的最小整数，［ｂ］表不大于ｂ的最大整数。     

两个不等式的简捷证法

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

关于一类和式的估值

设｛ａｎ｝为递增的正项等差数列：ａｎ＝ａ１＋（ｎ－１）ｄ，ｎ∈Ｎ，其中ｄ，ａ１＞０，本文讨论和式ｎｋ＝１１ａｋ＝１ａ１＋１ａ２＋…＋１ａｎ的估值，并解决文［１］中遗留的问题．定理１设ｄ≤２ａ１，则对任意ｎ∈Ｎ有ｍｎ≤ｎｋ＝１１ａｋ＜Ｍｎ①其中Ｍｎ...     

数学奥林匹克讲与练(22)

例题讲解１６９．ｎ个不同的实数组成一个递增序列写在第１行．将此序列的各项重排后写在第１行的下面,使各项依次对齐,作为第２行．再将这两行的各项分别相加,得到的ｎ个和数写下作为第３行．结果发现第３行的数也排成了递增的序列．求证：第１行与第２行的序列完全一致．证明　设第１行为ａ１＜ａ２＜…＜ａｍ＜ａｍ＋１＜…＜ａｎ,第２行为ｂ１,ｂ２,…,ｂｎ,它是ａ１,…,ａｎ的重排,则第３行为ａ１＋ｂ１＜ａ２＋ｂ２＜…＜ａｎ＋ｂｎ．若ａ１≠ｂ１,则有ａ１＝ｂｍ（２≤ｍ≤ｎ）．于是对每个ｉ：１≤ｉ≤ｍ－１,ａ１＋ｂ…     

恰有t行含对称正元的布尔方阵的幂敛指数的估值

设Ｄｎ，２（ｔ）为恰有ｔ行含对称正元的ｎ阶布尔方阵的集合，２≤ｔ≤ｎ。本文证明了，对于任给Ａ∈Ｄｎ，２（ｔ），幂敛指数ｋ（Ａ）≤∫（ｎ－ｔ－１）＾２＋１，３ｎ－ｔ－２，当ｔ≤ｎ－［３＋√８ｎ－７／２］当ｔ〉ｎ－［３＋√８ｎ－７／２］，这里［ｘ］表示不小于ｘ的最小整数。同时，我们还证明了这个界是可以达到的，并且对Ｄｎ，２（ｔ）的极矩阵集合作了部分刻划。     

贪婪t－相交有限序列族

设Ｆ为有限序列族，对ａ＝（ａ１，ａ２，…，ａｎ）∈Ｆ，ａｉ为整数且０≤ａｉ≤ｓｉ（整数），记ｓ（ａ）＝｛ｊ｜１≤ｊ≤ｎ，ａｊ＞０｝，ｓ（Ｆ）＝｛ｓ（ａ）｜ａ∈Ｆ｝，及Ａ｛１，２，…，ｎ｝时Ｗ（Ａ）＝Пｉ∈Ａｓｉ．称Ｆ为贪婪ｔ－相交，如对任何ａ，ｂ∈Ｆ，至少有ｔ个ａｉ，ｂｉ＞０，且Ｗ（Ａ）≥Ｗ（（｛１，２，…，ｎ｝－Ａ）＋Ｂ）对任何Ａ∈Ｓ（Ｆ）及ＢＡ（｜Ｂ｜＝ｔ－１）成立．本文得到当ｓ１＞ｓ２＞…＞ｓｎ时的最大贪婪ｔ－相交有限序列族．     

一个不等式的推广及应用

定理１若ａｉ∈Ｒ（ｉ＝１，２，３，…，ｎ），则ａ１＋ａ２＋…＋ａｎｎ≤ａ２１＋ａ２２＋…＋ａ２ｎｎ．那么，不等式ａ１＋ａ２＋…＋ａｎｎ≤ｍａｍ１＋ａｍ２＋…＋ａｍｎｎ是否成立呢？我仔细查阅了《数学手册》等有关资料未发现这个不等式，经过研究发现这个不等...     

图象分析引导我们深入探索——完善一道易错的题

１　一道易错的题题目　已知ｆ（ｘ）＝ａｘ２－ｃ,且－４≤ｆ（１）≤－１,－１≤ｆ（２）≤５,求ｆ（３）的范围．错解　依题意得　－４≤ａ－ｃ≤－１－１≤４ａ－ｃ≤５①②消元可得　０≤ａ≤３１≤ｃ≤７③④∵　ｆ（３）＝９ａ－ｃ,∴　－７≤ｆ（３）≤２６．正解　先用ｆ（１）、ｆ（２）表出ａ、ｃ,即有　　ｆ（１）＝ａ－ｃｆ（２）＝４ａ－ｃ　ａ＝１３［ｆ（２）－ｆ（１）］ｃ＝１３［ｆ（２）－４ｆ（１）］⑤⑥∵　ｆ（３）＝９ａ－ｃ＝８３ｆ（２）－５３ｆ（１）,∴　直接运用已知条件可得－１≤ｆ（３）≤２０．…     

Some characterizations of orthant monotonic norms

In real n-space the orthant monotonic norms of Gries [5] can be given a new characterization similar to one for monotonic norms: a norm is orthant monotonic if and only if for every D=diag(δ₁,δ₂,…,δ_n)?0, the operator norm of D equals max δ_i. This gives an alternative proof to Gries's: a norm is orthant monotonic if and only if its dual norm is orthant monotonic. Also, it follows that the principal axis vectors are self-dual for orthant monotonic norms.     

关于奇算术图

本文讨论了$n$个$m$长圈有一个公共结点图$C^n_m$, $n$个$m$长圈与$t$长路有一个公共结点图$C^n_m\cdot P_t$, $n$个$m$阶完全图有一个公共结点图$K^n_m$和星形图的同胚图的奇算术性问题.给出了完全图,完全二部图和圈是奇算术的充要条件.     

Monotonic models and cycles

A partitional model of knowledge is monotonic if there exists a linear order on the state space such that, for every player, each element of her partition contains only a sequence of consecutive states. In monotonic models, the absence of alternating cycles is equivalent to the property that, for every pair of players, the join of their partitions contains only singletons. Under these equivalent conditions any set of posteriors for the players is consistent (i.e., there is a common prior). When checking for consistency in a monotonic model, it is not necessary to evaluate all cycle equations; if the cycle equations corresponding to cycles of length two hold, then there is a common prior.     

关于一个完全单调函数

设α>0和β是实数,则函数1+αxx+β在(0,∞)上是完全单调的充要条件是α≤2β.这推广了已有的结果.     

自由亚交换群的直积的检验元素

设Sri(i=1,2,…,n)为秩ri的自由亚交换群,G=Sr1×Sr2…×Srn为自由亚交换群的直积,本文证明了G有检验元素的充分必要条件为ri=2(i=1,2,…,n)．同时,还证明了g=(g1,g2,…,gn)为G的检验元素的充分必要条件是:gi∈S′2-1(i= 1,2,…,n),且{g1,g2,…,gn}为独立集．此外,我们给出了一类具体的检验元素．     

Covering space for monotonic homotopy of trajectories of control systems

This paper considers monotonic (or causal) homotopy between trajectories of control systems. The main result is the construction of an analogue of the simply connected covering space. The constructed covering Γ(Σ,x) has the structure of a manifold and satisfies the property that two trajectories are monotonic homotopic if and only if the end points of their liftings coincide.     

Monotonic stable solutions for minimum coloring games

For the class of minimum coloring games (introduced by Deng et al. Math Oper Res, 24:751–766, 1999) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont Games Econ Behav 2:378–394, 1990). We show that a minimum coloring game on a graph $G$ has a population monotonic allocation scheme if and only if $G$ is $(P_4,2K_2)$ -free (or, equivalently, if its complement graph $\bar{G}$ is quasi-threshold). Moreover, we provide a procedure that for these graphs always selects an integer population monotonic allocation scheme.     

关于q-树二次整子图和n阶加点q-树色多项式的注记

在这篇文章中我们成功地仅用色多项式表征了最小度不等于q-3的q-树的二次整子图和n阶加点q-树,即当图的最小度δ(G)≠q-3时,n阶图G具有色多项式P(G;λ)=λ(λ-1)…(λ-q+2)(λ-q+1)~3(λ-q)~(n-q-2), n≥q+2,当且仅当G是n阶q-树的二次整子图或n阶加点q-树.     

Graceful Labelings of Nearly Complete Graphs

It is well known that the complete graph K_n is graceful only if n ≤ 4. We prove that K_n — e is graceful only if n ≤ 5 and that any K_n—2e and any K_n — 3e is graceful only if n ≤ 6. Moreover we determine all graceful graphs K_n — G, if G is a star K_1,a with a ≤ n - 2, and if G is a matching M_a with 2a ≤ n. Furthermore we give graceful labelings for the complete multipartite graphs K_1,a,b, K_2,a,b K_1,1,a,b and we conjecture that these together with K_a,b are the only complete multipartite graphs which are graceful.     

Complete monotonicity and limit of a generalized Euler sequence

We prove that if $f:(0,\infty)\to\mathbb{R}$ is a completely monotonic function then the generalized Euler sequence $$(a_n)_{n\ge1},\quad a_n=f(1)+\cdots+f(n)-\int _1^n f(t)\,dt $$ is completely monotonic, and under appropriate conditions on f we obtain an explicit formula for its limit. Some particular cases of Stieltjes constants are studied. We also give representations for the sum of some generalized harmonic series.