二项式系数的更多整除性质

设$a$, $b$和$n$为正整数,且$a>b$,我们证明了下面的整除性质: 对所有正整数$n$, 我们有$$(2bn+1)(2bn+3)(2bn+5){2bn\choose bn}\Big|15(a-b)(3a-b)(5a-b)(5a-3b){2an \choose an}{an\choose bn},$$ 上述整除式推广了杨全会一文中的相关结论.且对所有正整数$n$,我们证明了下面的整除性质:$$(6n+1){4n\choose n}\Big|{12n\choose 6n}{2n\choose n},\ (12n+1){5n\choose n}\Big|{15n\choose 3n}{3n-1\choose n-1},$$ $$(18n+1){12n\choose 9n}{8n\choose 2n}\Big| {24n\choose 18n}{4n\choose 2n}{6n\choose 3n}.$$更多类似的整除性质可以给出.     

Asymptotic Behavior of Solutions of Some Linear Difference Equations with Oscillatory Decreasing Coefficients

We investigate the asymptotic behavior of solutions of the system x ( n +1)=[ A + B ( n ) V ( n )+ R ( n )] x ( n ), n S n 0 , where A is an invertible m 2 m matrix with real eigenvalues, B ( n )= ~ j =1 r B j e i u j n , u j are real and u j p ~ (1+2 M ) for any M ] Z , B j are constant m 2 m matrices, the matrix V ( n ) satisfies V ( n ) M 0 as n M X , ~ n =0 X Á V ( n +1) m V ( n ) Á < X , ~ n =0 X Á V ( n ) Á 2 < X , and ~ n =0 X Á R ( n ) Á < X . If AV ( n )= V ( n ) A , then we show that the original system is asymptotically equivalent to a system x ( n +1)=[ A + B 0 V ( n )+ R 1 ( n )] x ( n ), where B 0 is a constant matrix and ~ n =0 X Á R 1 ( n ) Á < X . From this, it is possible to deduce the asymptotic behavior of solutions as n M X . We illustrate our method by investigating the asymptotic behavior of solutions of x 1 ( n +2) m 2(cos f 1 ) x 1 ( n +1)+ x 1 ( n )+ a sin n f n g x 2 ( n )=0 x 2 ( n +2) m 2(cos f 2 ) x 2 ( n +1)+ x 2 ( n )+ b sin n f n g x 1 ( n )=0 , where 0< f 1 , f 2 < ~ , 1/2< g h 1, f 1 p f 2 , and 0< f <2 ~ .     

On the Behaviour of Solutions of a Class of Third Order Difference Equations

In this paper, the structure of the solution space of y n +3 + ry n +2 + qy n +1 + py n =0, n S 0, is studied, keeping oscillatory/nonoscillatory behaviour of solutions of the equation in view, where p , q and r are constants. Some of these results are generalized partially to hold for y n +3 + r n y n +2 + q n y n +1 + p n y n =0, n S 0, where { p n }, { q n } and { r n } are sequences of real numbers.     

Smarandache函数在两数列上的下界估计

设S(n)是Smarandache函数,其中n是一正整数.讨论Smarandache函数S(n)在数列F((2k),1)=F(n,1)=n2n+1(n=2k)与数列G(2n,1)=(2n)2n+1上的下界估计.基于初等方法证明了:当偶数n≥6时,有S(F((2k),1))=S(F(n,1))≥6×2n+1;当n≥4时,有S(G(2n,1))≥6×2n+1.     

A General Comparison Result for Higher Order Nonlinear Difference Equations With Deviating Arguments

The authors consider m -th order nonlinear difference equations of the form D m p x n + i h j ( n , x s j ( n ) )=0, j =1,2,( E j ) where m S 1, n ] N 0 ={0,1,2,…}, D 0 p x n = x n , D i p x n = p n i j ( D i m 1 p x n ), i =1,2,…, m , j x n = x n +1 m x n , { p n 1 },…,{ p n m } are real sequences, p n i >0, and p n m L 1. In Eq. ( E 1 ) , p = a and p n i = a n i , and in Eq. ( E 2 ) , p = A and p n i = A n i , i =1,2,…, m . Here, { s j ( n )} are sequences of nonnegative integers with s j ( n ) M X as n M X , and h j : N 0 2 R M R is continuous with uh j ( n , u )>0 for u p 0. They prove a comparison result on the oscillation of solutions and the asymptotic behavior of nonoscillatory solutions of Eq. ( E j ) for j =1,2. Examples illustrating the results are also included.     

Banach空间非扩张映像不动点强收敛定理

设E是具弱序列连续对偶映像自反Banach空间, C是E中闭凸集, T:C→ C是具非空不动点集F(T)的非扩张映像.给定u∈ C,对任意初值x0∈ C,实数列{αn}n∞=0,{βn}∞n=0∈ (0,1),满足如下条件:(i)sum from n=α to ∞α_n=∞, α_n→0;(ii)β_n∈[0,α) for some α∈(0,1);(iii)sun for n=α to ∞|α_(n-1) α_n|<∞,sum from n=α|β_(n-1)-β_n|<∞设{x_n}_(n_1)~∞是由下式定义的迭代序列:{y_n=β_nx_n (1-β_n)Tx_n x_(n 1)=α_nu (1-α_n)y_n Then {x_n}_(n=1)~∞则{x_n}_(n=1)~∞强收敛于T的某不动点.     

Sn+1(1)中的极小超曲面的等谱问题

设M为Sn 1(1)中紧致极小超面Mn1,n2= Sn1nn1×Sn2nn2 Sn 1(1)为Sn 1(1)中的Clifford极小超曲面如果Specp( M) =specp( Mn1,n2) ,Specq( M) =specq( Mn1,n2) ,其中0≤p 相似文献   

立方幂补数除数函数的均值

设 n是正整数 ,S(n)是 n的立方幂补数 ,τ(n)表示 n的除数函数 .本文的主要目的是探讨∑n xτ(S(n) )n 和 ∑n xτ(S(n) ) 的渐近性质 ,得到了两个渐近公式 ,进一步解决 F.Smarandache教授提出的第2 8个问题 .     

P(n，k)的计数及其良域

设P(n,k)为整数n分为k部的无序分拆的个数,每个分部≥1;P(n)为n的全分拆的个数.P(n,k)是用途广泛的、且又十分难予计算的数.本文证明了下述定理：当n＜k,P(n,k)=0;当k≤n≤2k,P(n,k)=P(n-k);当k=1,4≤n≤5,或者当k≥2,2k+1≤n≤3k+2,P(n,k)=P(n-k)-(?)P(t)还定义了P(n,k)的良城,因面可借助若干个P(n)的值,迅速地计算大量的P(n,k)的值.     

典型域的调和函数论(Ⅱ)——对称方阵双曲空间的调和函数

<正> 2.1.对称方阵双曲空间的调和函数 命 Z 代表 n×n 对称方阵(?)(?)代表 n(n+1)/2 个复变数 z_(11),z_(12)…,z_(1n),z_(22),…,z_(2n),…z_(nn)空间的域     

相伴于随机自相似分形的随机测度的强测度的收敛性

构造了随机自相似分形及其上的记忆函数,并得出了有关结论,在此基础上,我们可以定义一个随机概率测度dΦn(τ)=Kn(τ)dτ,Φn(τ)弱收敛于Φ,进一步可得到强测度序列Ψn(·)=EΦn(·),则{Ψn}弱收敛于Ψ=EΦ.     

关于正整数奇偶分拆数的计算问题

正整数n的分拆是指将正整数n表示成一个或多个正整数的无序和,设O(n,m)表示将正整数n分拆成m个奇数之和的分拆数;e(n,m)表示将正整数n分拆成m个偶数之和的分拆数.本文用初等方法给出了将O(n,m),e(n,m)分别化为有限个O(n,2),e(n,2)的和的计算公式,进而达到计算O(n,m),e(n,m)的值.同时,还讨论了将正整数n分拆成互不相同的奇数或偶数的分拆数的相应的递推计算方法.     

Asymptotic approximation of solutions of nonlinear third order difference equations

In this paper, we obtain asymptotic bounds, under appropriate conditions, of solutions of third order difference equations of the form

SL(3,3~n)和SU(3,3~n)的第一Cartan不变量

确定Cartan不变量是代数群与相关的李型有限群的模表示理论中的一个重要方面.作者利用代数群模表示理论中的一系列结果,计算了3~n个元素的有限域上特殊线性群SL(3,3~n)和特殊酉群SU(3,3~n)的第一Cartan不变量,得到如下结论:当G=SL(3,3~n)时,C_(00)~((n))=a~n+b~n+6~n-2·8~n;而当G=SU(3,3~n)时,C_(00)~((n))=a~n+b~n+6~n-2·8~n+2·(1+(-1)~n),其中a,b是多项式x~2-20x+48的两个根.另外,作者也得到了射影不可分解模U_n(0,0)的维数公式:dim U_n(0,0)=(12~n-6~n+∈)·3~(3n),其中,当G=SL(3,3~n)时,∈=1;而当G=SU(3,3~n)时,∈=-1.     

偶图$K_{n,n+7}-A(|A|\leq3)$的圈长分布唯一性

阶为$n$的图$G$的圈长分布是序列($c_1,c_2,\ldots,c_n$), 其中$c_i$是图$G$中长为$i$的圈数.本文得到如下结果: 设$A\subseteq E(K_{n,n+7})$,在以下情况, 图 $G$ 由其圈长分布唯一确定.(1) $G=K_{n,n+7}$(n\geq10)$;(2) $G=K_{n,n+7}-A$ $(|A|=1,n\geq12)$;(3)$G=K_{n,n+7}-A$(|A|=2,n\geq14)$;(4)$G=K_{n,n+7}-A$ $(|A|=3     

关于正整数的立方部分

对于任意正整数n，定义u(n)为不大于n的最大立方数，v(n)为不小于n的最小立方数．研究了数列{u(n))和{v(n)}的性质，并给出了两个有趣的渐近公式．     

THE EXISTENCE OF OVERLARGE SETS OF IDEMPOTENT QUASIGROUPS

A idempotent quasigroup (Q, o) of order n is equivalent to an n(n-1)×3 partial orthogonal array in which all of rows consist of 3 distinct elements. Let X be a (n+1)-set. Denote by T(n+1) the set of (n+1)n(n-1) ordered triples of X with the property that the 3 coordinates of each ordered triple are distinct. An overlarge set of idempotent quasigroups of order n is a partition of T(n+1) into n+1 n(n-1)×3 partial orthogonal arrays A_x, x∈X based on X\{x}. This article gives an almost complete solution of overlarge sets of idempotent quasigroups.     

利用函数的傅里叶展开式求级数的和

利用函数的傅里叶展开式可求得级数∞∑n=11/n2+λ2及∞∑n=1(-1)m/n2+λ2的和,而通过引入复数并利用欧拉公式可求得级数∞∑n=1 1/n2+λ2及∞∑n=1(-1)m/n2+λ2的和.     

线性同余人字映射组合产生均匀随机数

研究了线性同余法与人字映射组合随机数发生器 :xn=Axn-1(mod M) ,wn=2 xn,　 xn≤ 0 .5 M,wn=2 (M-xn) +1 ,　 xn>0 .5 M,yn=wn/ M.该组合发生器比相应的线性同余法在空间结构上有明显改善 ,并通过统计检验     

F.Smarandache的一个问题

设 n是正整数 ,a( n)表示 n的三次方幂补数 .本文的主要目的是研究 a( n)和 a( n)n 的 k次均值性质 ,解决 F.Smarandache教授提出的第 2 8个问题 ,并用解析方法给出两个有趣的渐近公式