对《三角形内切圆的一个性质》证明的探讨

文[1]提出了三角形内切圆的一个性质:⊙O是△ABC的内切圆,与三边分别相切于E,F,D三点,则△ABC是直角三角形 S△ABC=AD·BD.图1经仔细研读,发现上述性质是正确的,但文[1]中存在两处错误.1、在证明性质之前,作者为了叙述方便,设BC=a,AC=b,AB=c,由切线长定理,设AD=AF=x,BD=BE=y,OE=OF=CE=CF=r.事实上,只有在明确了△ABC是直角三角形时才有OE=OF=CE=CF=r.在由“S△ABC=AD·BD”证明“△ABC是直角三角形”时不能事先假设OE=OF=CE=CF=r.而应当设OE=OF=r,CE=CF=z.2、在由“S△ABC=AD.BD”证明“△ABC是直角三角形”时,作者由S△ABC=AD.BD得出12(x+r)(y+r)=xy图2再次事先假定了△ABC是直角三角形.事实上,只要设BC=a,AC=b,AB=c,由切线长定理,设AD=AF=x,BD=BE=y,OE=OF=r,CE=CF=z.由S△ABC=AD.BD和海伦公式有(x+y+z)xyz=xy即(x+y+z)z=xy=S△ABC但S△ABC=21(a+b+c)r=(x+y+z)r,∴r=z.易...     

一类数列极限的求法

介绍了一类数列:a1=a,a2=b-b,…,an 2=b-b an,n=1,2,3,…的极限的一种简便求法     

一些(双)代数的不可约表示

本文完全刻画了下列代数k,k,k(x,Y,Z|ZX-qXZ=1-θY2,ZY=qYZ,YX= qXY>和M(p,q)=k的不可约表示．     

一个不等式推广的简证及修补

文[1]给出了下列命题已知x12 x22 … x1002=300,求证:x1 x2 … x100≤200.文[2]沿用文[1]的方法,利用探究的手段加强并推广了上述命题得到了下列两个命题:命题1若∑100i=1xi2=300,则∑100i=1xi≤100 3,当且仅当x1=x2=…=x100=3时,等号成立.命题2若∑ni=1xi2=m则∑ni=1xi≤mn.当且仅当x1=x2=…=xn=mn时,等号成立.进而通过联想,并用同样的手段又给出了下列两个命题:命题3若∑ni=1kixi=A,且∑ni=1ki=S0,其中ki>0(i=1,2,…,n),A与S0都是常数,则∑ni=1kixi2≥A2S0.当且仅当x1=x2=…xn=AS0时,等号成立.命题4若∑ni=1kixi2=m,且∑ni=1ki=S0,其…     

一类三次系统的极限环Ⅱ

讨论一类三次系统的极限环问题.这一系统包括了在a=c1,5=c2且a=-b或a=c1,6=c2或a=c1的限制下的系统.去掉了全部这些限制,得到的极限环存在唯一性定理比以前已得到的相关的定理更具广泛性.     

N=2 超对称KdV 方程的双线性形研究

利用双线性方法研究$N=2$超对称KdV方程. 通过适当的相关变换, 将$N=2, a=4$和$N=2, a=1$超对称KdV方程转化成双线性形式, 由此构造了相应方程的解. 对于$N=2, a=1$ 超对称KdV方程, 还得到了它的双线性B\"acklund变换和Lax 表示.     

一类含隅角和弯矩的奇异梁方程三个正解的存在性

利用格林函数方法和Avery-Peterson不动点定理研究了一类非线性四阶两点边值问题u(4)(t) =f(t,u(t),u′(t),u″(t)), 0 ＜ t ＜ 1,u(0) =u′(1) =u″(0) =u′″(1) =0多个正解的存在性,其中允许非线性项f(t,u,v,w)在t=0,t=1,u=0,v=0,w=0处奇异.在力学上该问题模拟了左端简单支撑右端被滑动夹子夹住的弹性梁的挠曲.由于非线性项同时涉及隅角和弯矩,因此主要结论对于梁的稳定性分析是有益的.最后我们给出了一个例子,进一步证实本文理论的严密性和可行性.     

资源有限的加权总完工时间单机排序问题

本讨论资源有限的加权总工时间单机排序问题，对现在仍为OPEN问题1｜pj=bj-ajuj，∑uj≤U｜∑wjCj给出了一个有关最优解中最优资源分配的重要性质，并利用该性质分别给出了三种情况bj=b,wj=w,aj=a；bj=b,wj=w,uj=u；aj=a,wj=w,uj=u的最优算法。     

双物理摆的混沌分析

为了给一种新型振动机的参数设计提供理论依据,将其抽象为双物理摆的力学、数学模型.借助Matlab软件对其振动系统发生的动力学特性进行仿真分析,得到了在给定参数a=0.01,b=0.0218,r=0.04,m1=2.16,m2=3.2,fv=0.1772,Jb=3.4798×10-3下的力学行为的五个混沌特征.     

关于“一组有趣的数字”的进一步探讨

王世强教授在文[1]中介绍了这样一组有趣的数字：若 a=123789,b=561945,c=642864; d=242868,e=323787,f=761943． 则有 a＋b＋c=d＋e＋f及a^2＋b^2＋c^2=d^2＋e^2＋f^2（＊）把a,b,c,d,e,f的最高1位,2位,3位,4位,5位数字依次去掉后,仍有（＊）式成立．     

Experimental investigation of the dependence of the birefringence effect on the elastic and rubbery strains for certain epoxy polymers at room temperature

The strain dependence of the optical path difference δ=δ(e, ?*) has been investigated for certain network polymers. It is shown that this dependence can be represented in the form: δ=αe+β?*, where α and β are the elastic (e) and rubbery (?*) strain optic coefficients. Values of the coefficients α and β are determined and their properties are investigated. The possibility of determining the strains in parts made of the investigated polymers from the known effects is examined.     

一个包含Smarandache函数及第二类伪Smarandache函数的方程

主要研究方程Z2（n）＋1=S（n）的可解性,利用初等方法以及Smarandache函数的性质,证明了该方程有无穷多个正整数解,并获得了所有正整数解的具体表现形式．     

On the complexity of growth of the number of distinct fuzzy switching functions

Several attempts have been made to enumerate fuzzy switching (FSF's) and to develop upper and lower bounds for the number of FSF's of n variables in an effort to better understand the properties and the complexity of FSF's. Previous upper bounds are 2⁴ⁿ [9] and 2^{2–3n—2n—1} [7].It has also been shown that the exact numbers of FSF's of n variables for n = 0, 1, 2, 3, and 4 are 2, 6, 8, 84, 43 918 and 160 297 985 276 respectively.This paper will give a brief overview of previous approaches to the problem, study some of the properties of fuzzy switching functions and give improved upper and lower bounds for a general n.     

凸区域上椭圆方程弱解的边界唯一延拓性和B_p权特性

本文研究非光滑凸区域上的散度型二阶椭圆方程 ｉ（ａｉｊ（Ｘ）　ｊｕ（Ｘ））＝０的非零弱解的近边无穷次消失性和双倍性质，刻划弱解梯度在区域边界上的Ｂｐ权特性，建立弱解和弱解的梯度在凸区域边界的任意开子集上不可能同时消失的边界唯一延拓性定理．     

On certain quotients of the Green rings of dihedral 2-groups

In this paper we study the properties of Green rings of dihedral 2-groups, and in particular certain quotients of these Green rings introduced by Benson and Carlson. It is shown that these quotients can be realised as group rings over . The properties of the corresponding groups are investigated: they are shown to be abelian, torsion-free and infinitely generated. We also show how taking products of elements of these groups is related to the structure of the Auslander–Reiten quivers for dihedral 2-groups.     

Minkowski Sums of Monotone and General Simple Polygons

Let P be a simple polygon with m edges, which is the disjoint union of k simple polygons, all monotone in a common direction u, and let Q be another simple polygon with n edges, which is the disjoint union of ℓ simple polygons, all monotone in a common direction v. We show that the combinatorial complexity of the Minkowski sum P ⊕ Q is O(kℓmnα(min{m,n})), where α(·) is the inverse Ackermann function. Some structural properties of the case k = ℓ = 1 have been (implicitly) studied in [17]. We rederive these properties using a different proof, apply them to obtain the above complexity bound for k = ℓ = 1, obtain several additional properties of the sum for this special case, and then use them to derive the general bound.     

Algebraic methods for the solution of linear functional equations

The equation

$$\sum^{n}_ {i=0} a_{i}f(b_{i}x + (1 - b_{i})y) = 0$$

belongs to the class of linear functional equations. The solutions form a linear space with respect to the usual pointwise operations. According to the classical results of the theory they must be generalized polynomials. New investigations have been started a few years ago. They clarified that the existence of non-trivial solutions depends on the algebraic properties of some related families of parameters. The problem is to find the necessary and sufficient conditions for the existence of non-trivial solutions in terms of these kinds of properties. One of the earliest results is due to Z. Daróczy [1]. It can be considered as the solution of the problem in case of n = 2. We are going to take more steps forward by solving the problem in case of n = 3.

     

Regular Moebius transformations of the space of quaternions

Quaternionic Moebius transformations have been investigated for more than 100 years and their properties have been characterized in detail. In recent years G. Gentili and D. C. Struppa introduced a new notion of regular function of a quaternionic variable, which is developing into a quite rich theory. Several properties of regular quaternionic functions are analogous to those of holomorphic functions of one complex variable, although the diversity of the non-commutative setting introduces new phenomena. Unfortunately, the (classical) quaternionic Moebius transformations are not regular. However, in this paper we are able to construct a different class of Moebius-type transformations that are indeed regular. This construction requires several steps: we first find an analog to the Casorati-Weierstrass theorem and use it to prove that the group \({Aut(\mathbb{H})}\) of biregular functions on \({\mathbb{H}}\) coincides with the group of regular affine transformations. We then show that each regular injective function from \({\widehat{\mathbb{H}} = \mathbb{H}\cup \{\infty\}}\) to itself belongs to a special class of transformations, called regular fractional transformations. Among these, we focus on the ones which map the unit ball \({\mathbb{B} = \{q \in \mathbb{H} : |q| < 1 \}}\) onto itself, called regular Moebius transformations. We study their basic properties and we are able to characterize them as the only regular bijections from \({\mathbb{B}}\) to itself.     

M-矩阵的性质与Hadamard-Fisher不等式的注记

主要研究了两个M-矩阵的比较性质与不等式,给出了M-矩阵与逆M-矩阵Hadamard-Fisher不等式等式成立的矩阵结构.     

On the accuracy of statistical procedures in Microsoft Excel 2010

All previous versions of Microsoft Excel until Excel 2007 have been criticized by statisticians for several reasons, including the accuracy of statistical functions, the properties of the random number generator, the quality of statistical add-ins, the weakness of the Solver for nonlinear regression, and the data graphical representation. Until recently Microsoft did not make an attempt to fix all the errors in Excel and was still marketing a product that contained known errors. We provide an update of these studies given the recent release of Excel 2010 and we have added OpenOffice.org Calc 3.3 and Gnumeric 1.10.16 to the analysis, for the purpose of comparison. The conclusion is that the stream of papers, mainly in Computational Statistics and Data Analysis, has started to pay off: Microsoft has partially improved the statistical aspects of Excel, essentially the statistical functions and the random number generator.