关于多项式系数的整除性

设n是正整数,k1,k2,…+k1=n的非负整数,正整数[nk1k2…ks]=n！/k1!k2!…k5!称为多项式系数,本文讨论了当n=a0+a1p+a2p^2+…arp^r,其中p为素数且p≤n,0≤ai&;lt;p(0≤i≤r);ki=a0^(i)+a1^(i)p+…+ar^(i)p^r,其中ki≤0,∑^si=1,ki=n,0≤ak^(i)p(0≤i&;lt;s)时多项式系数的整除性问题,得出的结果推广了著名的Lucas定理^[1].     

关于多项式系数的整除性

设 n是正整数 ,k1 ,k2 ,… ,ks 是适合 k1 +k2 +… +ks=n的非负整数 ,正整数 nk1 k2 … ks=n!k1 !k2 !… ks!称为多项式系数 .本文讨论了当n=a0 +a1 p+a2 p2 +… +arpr ,其中 p为素数且 p≤ n,0≤ ai相似文献   

包含置换的同余式（英文）

设A_2(n)={(ij)|1≤ij≤n,(ij,n)=1},A_3(n)={(ijl),(ilj))|1≤ijl≤n,(ijl,n)=1},其中(x_1 x_2…x_k)表示循环置换,当ik时,把x_i映射到x_(i+1),x_k映射到x_1,其他元素映射到自身.我们得到了∑σ∈A~2(n)∑nk+1 σ(k)/k~m和∑∑nk+1 σ(k)/k~m的同余式,其中σ表示置换.同时,令素数p≥5,H(k)=∑_(i=1)~k1/i,我们证明了∑σ∈A_2(p)∑p=1k=1σ~m(k)H(k)≡2B_m(mod p) ∑σ∈A_3(p)∑p=1k=1σ~m(k)H(k)≡-5B_m(mod p).     

Dynamics of a Function Related to the Primes

Let n = p1p2 ··· pk, where pi(1 ≤ i ≤ k) are primes in the descending order and are not all equal. Let Ωk(n) = P(p1 + p2)P(p2 + p3) ··· P(pk-1+ pk)P(pk+ p1), where P(n) is the largest prime factor of n. Define w0(n) = n and wi(n) = w(wi-1(n)) for all integers i ≥ 1. The smallest integer s for which there exists a positive integer t such thatΩs k(n) = Ωs+t k(n) is called the index of periodicity of n. The authors investigate the index of periodicity of n.     

On a family involving R.L. Cohen's ζ-element(II)

In 1981, Cohen constructed an infinite family of homotopy elements ζk∈π*(S) represented by h0bk∈ Ext3,2(p-1)(pk+1+1)A(Z/p, Z/p) in the Adams spectral sequence, where p 2 and k≥1. In this paper,we make use of the Adams spectral sequence and the May spectral sequence to prove that the composite map ζn-1β2γs+3is nontrivial in the stable homotopy groups of spheres πt(s,n)-s-8(S), where p≥7, n 3,0≤s p- 5 and t(s, n) = 2(p- 1)[pn+(s + 3)p2 +(s + 4)p +(s + 3)] + s.     

不等式研究成果集锦(15)

178　设 xi>0 ,yi>0 (i=1 ,2 ,… ,n,n≥2 ) ,实数 p≥ 2 ,如果 ∑ni=2x2i ≤ x21,∑ni=2y2i ≤ y21,那么[(xp1- ∑ni=2xpi) (yp1- ∑ni=2xpi) ]1p ≥ x1y1-∑ni=2xiyi- ∑ni=2|y1xi- x1yi|,当且仅当 p =2 ,x1y1= x2y2=… =xnyn时取等号 .(文家金 .2 0 0 0 ,5～ 6)1 79　设 b1,b2 ,… ,bn是实数 ,而 a1≥ a2 ≥…≥ an >0 ,又设 ∑kj=1aj≤ ∑kj=1bj(k=1 ,2 ,… ,n- 1 ) .∑nj=1aj ≥ ∑nj=1bj,则当 0

相似文献   

关于不定方程组x~2-12y~2=1与y~2-Dz~2=4的解

设p1,…,ps(1≤s≤3)是互异的奇素数,则当D=p_1…p_s,1≤s≤3时,不定方程组x~2-12y~2=1与y~2-Dz~2=4仅有正整数解D=195,(x,y,z)=(97,28,2).     

若干并图的优美标号

证明了,对任意大于1的自然数m,n,p,非连通图(■ V ■)∪K_(n,p)是优美图;当k≤p,m=kn+3或m=kn+1时,非连通图(P_2 V ■)∪K_(n,p)是优美图;当p≥2,m=3k+1时,非连通图(P_2 V ■)∪K_(3,p)是优美图;对任意正整数n,p,非连通图(P_1 V P_(2n+2))∪_(n,p)是优美图.     

A Relation in the Stable Homotopy Groups of Spheres

Let p≥7 be an odd prime. Based on the Toda bracket α1βp-11, α1 β1, p, γs,the authors show that the relation α1βp-11h2,0 γs= βp/p-1γs holds. As a result, they can obtain α1βp1h2,0 γs = 0 ∈π*(S0) for 2≤s≤p- 2, even though α1h2,0γs and β1α1h2,0 γs are not trivial. They also prove that βp-11α1 h2,0 γ3 is nontrivial in π*(S0) and conjecture that βp-11α1 h2,0 γs is nontrivial in π*(S0) for 3≤s≤p- 2. Moreover, it is known thatβp/p-1γ3 = 0 ∈ Ext5,*BP*BP(BP*, BP*), but βp/p-1γ3 is nontrivial in π*(S0) and represents the element βp-11α1 h2,0 γ3.     

二阶齐次递推数列具有周期性的一个充分条件

文[1]中曾给出如下定理:数列{an}满足an 2=pan 1-an,且p=2cos2kπ(k>2,k∈N ),则k是它的一个周期.文[2]中又将其进一步加强为k即是其最小正周期.换句话说,若p=2cos2kπ,则该数列就是以k为最小正周期的周期数列.那么,对于一般地二阶齐次递推数列{an},满足an 2 pan 1 qan=0(p,q∈R,n∈N ),当p,q满足什么条件时就会使其具有周期性呢?笔者通过分析,寻求到了使该数列具有周期性的一个充分条件:q=1且|p|<2.证对于数列{an},其特征方程为x2 px q=0,假若Δ=p2-4q<0,则其有一对共轭虚根:x1=r(cosθ isinθ),x2=r(cosθ-isinθ),其中θ∈(0,π),r>0.…     

A note on the biasing of Newton's direction

This note deals with the geometric interpretation of the Levenberg-Marquardt search direction when the augmented Hessian is not positive definite.     

On the Convergence of Descent Algorithms

It is proved that any cluster point of a sequence defined by a steepest descent algorithm in a general normed vector space is a critical point. The function is just assumed to be continuously differentiable. The class of algorithms we consider encompasses several choices such as the Cauchy steplength and the Curry steplength.     

Stabilization of algebraic multilevel iteration methods; additive methods

There exist two main versions of preconditioners of algebraic multilevel type, the additive and the multiplicative methods. They correspond to preconditioners in block diagonal and block matrix factorized form, respectively. Both can be defined and analysed as recursive two-by-two block methods. Although the analytical framework for such methods is simple, for many finite element approximations it still permits the derivation of the strongest results, such as optimal, or nearly optimal, rate of convergence and optimal, or nearly optimal order of computational complexity, when proper recursive global orderings of node points have been used or when they are applied for hierarchical basis function finite element methods for elliptic self-adjoint equations and stabilized in a certain way. This holds for general elliptic problems of second order, independent of the regularity of the problem, including independence of discontinuities of coefficients between elements and of anisotropy. Important ingredients in the methods are a proper balance of the size of the coarse mesh to the finest mesh and a proper solver on the coarse mesh. This paper presents in a survey form the basic results of such methods and considers in particular additive methods. This method has excellent parallelization properties. This revised version was published online in June 2006 with corrections to the Cover Date.     

Convergence of Rothe's Method in Hölder Spaces

The convergence of Rothe's method in Hölder spaces is discussed. The obtained results are based on uniform boundedness of Rothe's approximate solutions in Hölder spaces recently achieved by the first author. The convergence and its rate are derived inside a parabolic cylinder assuming an additional compatibility conditions.     

A comparison of some ODE solvers which require Jacobian evaluations

A variety of third-order ODE solvers which have a minimum configuration (i.e. minimum work per step) have been numerically tested and the results compared. They include implicit and explicit processes, and share the property that a Jacobian matrix must be evaluated at least once during the integration. Some of these processes have not been previously described in the literature.     

Local convergence of the diagonalized method of multipliers

In this study, we consider a modification of the method of multipliers of Hestenes and Powell in which the iteration is diagonalized, that is, only a fixed finite number of iterations of Newton's method are taken in the primal minimization stage. Conditions are obtained for quadratic convergence of the standard method, and it is shown that a diagonalization where two Newton steps are taken preserves the quadratic convergence for all multipler update formulas satisfying these conditions.This work constitutes part of the author's doctoral dissertation in the Department of Mathematical Sciences, Rice University, under the direction of Professor R. A. Tapia and was supported in part by ERDA Contract No. E-(40-1)-5046.The author would like to thank Professor Richard Tapia for his comments, suggestions, and discussions on this material.     

浅析大M法与两阶段法的一致性

分析了大M法与两阶段法在思想方法、辅助线性规划问题的构造、初始可行基、初始单纯形表、最优性检验和算法步骤等方面的一致性.     

Analysis of finite element approximation and quadrature of Volterra integral equations

In this article we study Galerkin finite element approximations to integral equations of the Volterra type. Our prime concern is the noncoercive case, which is not covered by the standard finite element theory. The question of rates of convergence is studied for the case where an exact stiffness matrix is available, as well as the case where the latter is approximated via quadrature rules. The optimality of these rules is also considered from the point of view of the effect the choice of the quadrature has on the overall rate of convergence. © 1997 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 13: 663–672, 1997     

Application of homotopy perturbation methods for solving systems of linear equations

In this paper, homotopy perturbation methods (HPMs) are applied to obtain the solution of linear systems, and conditions are deduced to check the convergence of the homotopy series. Moreover, we have adapted the Richardson method, the Jacobi method, and the Gauss-Seidel method to choose the splitting matrix. The numerical results indicate that the homotopy series converges much more rapidly than the direct methods for large sparse linear systems with a small spectrum radius.     

Analysis of the Fictitious Domain Method with an L 2-Penalty for Elliptic Problems

The L ²-penalty fictitious domain method is based on a reformulation of the original problem in a larger simple-shaped domain by introducing a discontinuous reaction term with a penalty parameter ε > 0. We first derive regularity results and some a priori estimates and then prove several error estimates. We also give several error estimates for discretization problems by the finite element and finite volume methods.