A primitive trinomial of degree 6972593

The only primitive trinomials of degree over are and its reciprocal.

     

ASYMPTOTIC BEHAVIOR OF SOLUTIONS FOR A CLASS OF DELAY DIFFERENCE EQUATION

We propose a class of delay difference equation with piecewise constant nonlinearity. Such a delay difference equation can be regarded as the discrete analog of a differential equation. The convergence of solutions and the existence of asymptotically stable periodic solutions are investigated for such a class of difference equation.     

GLOBAL ASYMPTOTIC STABILITY OF x_(n 1)=F(x_n)g(x_(n-1))

1IntroductionConsiderthedifferenceequationwithpositiveinitialconditionswherethefunctionFandgsatisfythefollowinghypotheses:(HI)F,geC[(0,co),(0,co)1;(Hi)Fisincreasingandgisdecreasing;No.3LiL.T.,GLOBALASYMPTOTICSTABILITYOFxu 1=F(x.)g(x.~1)519(Hs)Theequationx…     

A fast algorithm for testing reducibility of trinomials mod 2 and some new primitive trinomials of degree 3021377

The standard algorithm for testing reducibility of a trinomial of prime degree over requires bits of memory. We describe a new algorithm which requires only bits of memory and significantly fewer memory references and bit-operations than the standard algorithm.

If is a Mersenne prime, then an irreducible trinomial of degree is necessarily primitive. We give primitive trinomials for the Mersenne exponents , , and . The results for extend and correct some computations of Kumada et al. The two results for are primitive trinomials of the highest known degree.

     

关于1~k+2~k+…+n~k求和的三种方法

就差分方法、伯努利公式以及组合公式三种方法对 ∑ni=1ik求和 .     

一类Lyness方程的一些性质

本文主要研究下列Lyness方程的性质Xn+1=Xn\(a+b0Xn+b1Xn-1+…+bkXn-k)Xn-k-1,n=0,1,2,…,其中a,b0,b,…,bk∈[0,∞),a+k∑i=0bi＞0,k∈{0,1,2,…}.文中给出了方程(*)严格振动的充分条件,以及环长和环上极值的位置.另外,还得到了方程(*)在特殊情况下分别具有4,5,6周期的必要充分条件.本文的结果改进并推广了一些已知结果.     

Explicit primality criteria for

Deterministic polynomial time primality criteria for have been known since the work of Lucas in 1876-1878. Little is known, however, about the existence of deterministic polynomial time primality tests for numbers of the more general form , where is any fixed prime. When (p-1)/2$"> we show that it is always possible to produce a Lucas-like deterministic test for the primality of which requires that only modular multiplications be performed modulo , as long as we can find a prime of the form such that is not divisible by . We also show that for all with such a can be found very readily, and that the most difficult case in which to find a appears, somewhat surprisingly, to be that for . Some explanation is provided as to why this case is so difficult.

     

B样条在一些渐近组合问题中的应用

本文考察了B样条函数及其导数的渐近性质,并给出了收敛阶;考察了经典Eulerian数和两类广义Eulerian数的渐近性质;给出了以Hermite多项式表示的细化Eulerian数的渐近形式.Carlitz等人利用中心极限定理得到Eulerian数渐近公式的逼近阶为43阶.利用样条方法,我们得到更为精确的逼近阶.将样条方法引入到组合数的渐近分析中,为离散对象的研究提供了一种新的分析方法.     

含最大值函数的递归序列解的行为

本文研究了下列含最大值函数的差分方程解的行为：xn 1=max(xn^1 1,A)/xn^axn-k,n=0,1,2,…,其中α∈[0,∞],A∈（0,∞）and k∈(1,2,3,…）。得到了方程（＊）的严格振动性,环长,周期性以及方程（＊）解的非平凡正解极限的不存在性的一些充分条件,这些结果包含和推广了一些已知的结果并部分解答了G.Ladas的两个公开问题。     

Finite difference calculus for alternating permutations

The finite difference equation system introduced by Christiane Poupard in the study of tangent trees is reinterpreted in the alternating permutation environment. It makes it possible to make a joint study of both tangent and secant trees and calculate the generating polynomial for alternating permutations by a new statistic, referred to as being the greater neighbour of the maximum.