首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 125 毫秒
1.
图1我们先了解关于圆内接三角形的一个性质.如图1,△x1y1z1为⊙O的内接三角形,P为圆内一点,x1P、y1P、z1P与圆分别交于x2、y2、z2.则△x1y1z1△x2y2z2=Px1·Py1·Pz1Px2·Py2·Pz2.注本文等式中的“△xyz”均表示△xyz的面积.简证设⊙O的半径为R,连z1O并延长交圆于y1′,连x1y1′,则∠x1y1z1=∠x1y1′z1.于是△x1y1z1=12x1y1·y1z1·sin∠x1y1z1=12x1y1·y1z1·sin∠x1y1′z1=12x1y1·y1z1·x1z12R=14Rx1y1·y1z1·x1z1.同理△x2y2z2=14Rx2y2·y2z2·x2z2.故△x1y1z1△x2y2z2=x1y1·y1z1·x1z1x2y2·y2z2·x2z2=  相似文献   

2.
祝东进 《大学数学》2002,18(6):111-112
对两个独立样本ξi,1≤i≤n1,ξ1~N(a1,σ2);ηi,1≤i≤m2,η1~N(a2,σ2),证明了ξ-η-与√n1S21+n2S22独立,进而证明(√)n1n2(n1+n2-2)/n1+n2·(-ξ--η)-(a1-a2)/(√)n1S21+n2S22服从参数为n1+n2-2的t分布.  相似文献   

3.
假定Γ是一个有限的、单的、无向的且无孤立点的图,G是Aut(Γ)的一个子群.如果G在Γ的边集合上传递,则称Γ是G-边传递图.我们完全分类了当G为一个有循环的极大子群的素数幂阶群时的G-边传递图.结果为:设图Γ含有一个阶为pn(p是素数,n≥2)的自同构群,且G有一个极大子群循环,则Γ是G-边传递的,当且仅当Γ同构于下列图之一1)pmK1,pn-1-m,0≤m≤n-1;2)pmK1,pn-m,0≤m≤n;3)pmKp,pn-m-1,0≤m≤n-2;4)pn-mCpm,pm≥3,m<n;5)2n-2K1,1;6)pn-1-mCpm,pm≥3,m≤n-1;7)2pn-mCpm,pm≥3,m≤n-1;8)2pn-mK1,pm,0≤m≤n;9)pn-mK1,2pm,0≤m≤n;10)pn-mK2,pm,0<m≤n;11)C(2pn-m,1,pm);12)pkC(2pm-k,1,pn-m),0<k<m,0<m≤n;13)(t-s,2m)C(2m 1/(t-s,2m),1,2n-1-m),其中0≤m≤n-1,2n-2(s-1)≡0(mod 2m),t≡1(mod 2),s(≠)t(mod 2m),1≤s≤2m,1≤t≤2n-1;14)∪p i=1 Ci p n-1,其中Ci p n-1=Ca1a1 [1 (i-1)pn-2]a 1 2[1 (i--1)p n-2]…a 1 (pn-1-1)[1 (i-1)p n-2]≌Cp n-1,i=1,2,…,p;15)∪2 i=1 Ci 2n-1,其中Ci 2n-1=Ca1a 1 [1 (i-1)(2n-2-1)]a1 2[1 (i-1)(2n-2-1)]…a1 (2n-1-1)[1 (i-1)(2n-2-1)]≌C2n-1,i=1,2.  相似文献   

4.
Let G(V, E) be a unicyclic graph, Cm be a cycle of length m and Cm G, and ui ∈ V(Cm). The G - E(Cm) are m trees, denoted by Ti, i = 1, 2,..., m. For i = 1, 2,..., m, let eui be the excentricity of ui in Ti and ec = max{eui : i = 1, 2 , m}. Let κ = ec+1. Forj = 1,2,...,k- 1, let δij = max{dv : dist(v, ui) = j,v ∈ Ti}, δj = max{δij : i = 1, 2,..., m}, δ0 = max{dui : ui ∈ V(Cm)}. Then λ1(G)≤max{max 2≤j≤k-2 (√δj-1-1+√δj-1),2+√δ0-2,√δ0-2+√δ1-1}. If G ≌ Cn, then the equality holds, where λ1 (G) is the largest eigenvalue of the adjacency matrix of G.  相似文献   

5.
For p>1,many improved or generalized results of the well-known Hardy's inequality have been established.In this paper,by means of the weight coefficient method,we establish the following Hardy type inequality for P=-1:n∑i=1(1/ii∑j=1aj)-1<2n∑i=1(1-π2-9/3i)ai-1,Cn such that the inequality ∑ni=1(1/i∑ij=1 aj)-1≤Cn∑ni=1ai-1 holds.Moreover,by means of the Mathematica software,we give some examples.  相似文献   

6.
1/2+1/4+1/8+1/32+1/64=? (得意):63/64! 1/2+1/4+1/8+1/32+1/64+……+1/1024=?  相似文献   

7.
杨华 《数学通报》2013,(6):53+57
贵刊文[1]、文[2]给出了下列一类条件不等式.若a,b,c>0,且a+b+c=1,则1/(1+a2)+1/(1+b2)+1/(1+c2)≤27/10.(1)若a,b,c,d>0,且a+b+c+d=1,则1/(1+a3)+1/(1+b3)+1/(1+c3)+1/(1+d3)≤256/65.(2)若a,b,c,d>0,且a+b+c+d=1,则1/(1+a2)2+1/(1+b2)2+1/(1+c2)2+1/(1+d2)2≤824/289.(3)笔者认为不等式(3)应改为:  相似文献   

8.
一日,一学生问了一个题目,即下面的: 例1 已知f(x)=2-1/x,数列{an}满足,1〈a1〈2,an+1=f(an),证明1〈an+1〈an〈2.  相似文献   

9.
(2010年浙江大学自主招生试题)有小于1的正数:x1,x2,…,xn且x1+x2+…+xn=1.求证:1/x1-x2^3+1/x2-x2^3+…+1/xn-xn^3〉4.  相似文献   

10.
利用幂级数展式和凸函数的性质把关于一个不等式的推广和强化的两个最新结果推广到更加一般的情形p(p -1 ) d ap- 1pn+1-ap- 1pm <∑nk=m1a1pk相似文献   

11.
12.
We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.  相似文献   

13.
本文在LF拓扑空间中建立了L-fuzzy集网的弱收敛(R-收敛)概念,应用文[4]中的R-闭包,系统讨论了它们的性质,证明了等式RlimA_n=∧(∨A_m)_R和RlimA_n=A_n=∧(∨A_m)_R并且给出了L-fuzzy集网与其子网之间的关系。  相似文献   

14.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2.  相似文献   

15.
An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.  相似文献   

16.
Let R(A) denote the row space of a Boolean matrix A of order n. We show that if n 7, then the cardinality |R(A)| (2n–1 - 2n–5, 2n–1 - 2n–6) U (2n–1 - 2n–6, 2n–1). This result confirms a conjecture in [1].AMS Subject Classification (1991): 05B20 06E05 15A36Support partially by the Postdoctoral Science Foundation of China.Dedicated to Professor Chao Ko on the occasion of his 90th birthday  相似文献   

17.
Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing Ap.  相似文献   

18.
N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.  相似文献   

19.
马海成 《数学研究》2003,36(2):215-218
设P1,P2,……,Pt是几乎覆盖图G的l条不相交的路,s是没有被这些路覆盖的孤立点数.本证明:(i)匹配多项式μ(G,x)的非零根的重数最多是l,零根的重数最多l s。(ii)对于不含三角形的n阶图G,伴随多项式h(G,x)的非零根的重数最多是l,零根的重数最多是1/2(n l s).(iii)对一种含三角形的所谓A型图,(ii)也成立.  相似文献   

20.
任意矩阵的特征值的扰动估计   总被引:1,自引:0,他引:1  
宋永忠 《应用数学》1992,5(4):19-25
设A和B是两个任意的n阶方阵,其特征值分别为{λ_1,…,λ_n}和{μ_1,…,μ_n}.本文对此两组特征值的如下“距离”的界给出了若干估计: B对于A的谱改变量 A与B的特征值的改变量这里的结果包含了Bauer-Fike定理,并且优于Kahan-Parlett/Jiang定理及Chu,施和肖所得出的结果.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号