Dynamics of a Rational Difference Equation

The authors investigate the global behavior of the solutions of the difference equation xn＋1=axn-1xn-k/bxn-p＋cxn-q,n=0,1,…where the initial conditions x-r, x-r＋1, x-r＋2,… , x0 are arbitrary positive real numbers, r = max{l, k,p, q） is a nonnegative integer and a, b, c are positive constants. Some special cases of this equation are also studied in this paper.     

GLOBAL ATTRACTIVITY IN A CLASS OF HIGHER-ORDER NONLINEAR DIFFERENCE EQUATION

In this paper the global attractivity of the nonlinear difference equation xn 1 = a bxn / A xn-k, n =0, 1, …，is investigated, where a, b, A ∈ (0, ∞), k is an positive integer and the initial conditions x- k, …，x- 1 and x0 are arbitrary positive numbers. It is shown that the unique positive equilibrium of the equation is global attractive. As a corollary, the result gives a positive confirmation on the conjecture presented by Kocic and Ladas [1,p154].     

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.     

一类变时滞差分方程的振动性

Consider the nonautonomous delay logistic equation △yn=pnyn(1-n≥0 (1)where {pn}n≥0 is a sequence of nonnegative real numbers, {ln}n≥0 is a sequence of positive integers satisfying lim (n-ln)=∞, and k is a positive constant. Only solutions which are positive for n ≥ 0 are considered. We obtain a new sufficient for all positive solutions of (1) to oscillate about k which contains the corresponding result in [2] when I=1.     

某些Ruzsa数$R_m$的新上界

For A ■ Z m and n ∈ Z m ,let σ A (n) be the number of solutions of equation n = x + y,x,y ∈ A.Given a positive integer m,let R m be the least positive integer r such that there exists a set A ■ Z m with A + A = Z m and σ A (n) ≤ r.Recently,Chen Yonggao proved that all R m ≤ 288.In this paper,we obtain new upper bounds of some special type R kp 2 .     

On the Diophantine Equation x2 - kxy ＋ y2 ＋ 1x = 0

Let l be a given nonzero integer.The authors give an explicit characterization of the positive integer k that makes the Diophantine equation x2-kxy+y2+lx=0 have infinitely many positive integer solutions(x,y).     

QUALITATIVE ANALYSIS OF BOBWHITE QUAIL POPULATION MODEL

In this paper, the qualitative behavior of solutions of the bobwhite quail pop-ulation modelwhere 0   

Invariant Tori and Boundedness in Asymmetric Oscillations

In this paper,we are concerned with the boundedness of all the solutions of the equation x″ ax^ -bx- Ф(x)=p(t),where p(t) is a smooth 2π-periodic function,a and b are positive constants,and the perturbation Ф(x) is bounded.     

随机有向循环图的连通度

In this paper, we prove that almost all circulant digraphs are strongly connected. Furthermore, for any given positive integer m, we show that almost every circulant digraph C has connectivity at least m/1 m(d(C) 1), where d(C) is the vertex degree of C.     

关于商高数的Je\'{s}manowicz猜想

Let(a, b, c) be a primitive Pythagorean triple. Je′smanowicz conjectured in 1956 that for any positive integer n, the Diophantine equation(an)x+(bn)y=(cn)z has only the positive integer solution(x, y, z) =(2, 2, 2). Let p ≡ 3(mod 4) be a prime and s be some positive integer. In the paper, we show that the conjecture is true when(a, b, c) =(4p2s-1, 4p s, 4p2s+ 1) and certain divisibility conditions are satisfied.     

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

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

丢番图方程X~2-(a~2+1)Y~4=3-4a

设a≥2是正整数.本文证明了:当a=2时,方程X~2一(a~2+1)Y~4=3-4a仅有正整数解(X,Y)=(20,3);当a=3时,该方程仅有2组互素的正整数解(X,Y)=(1,1)和(79,5);当a≥4且4a+1非平方数时,该方程最多有4组互素的正整数解(X,Y);当a≥4且4a+1为平方数时,该方程最多有5组互素的正整数解(X,Y).     

有关Euler函数(n)的方程的正整数解

设(n)是Euler函数.主要研究了方程(xy)=3((x)+(y))的可解性问题,利用初等的方法给出了这一方程的所有的35组正整数解.对于任意素数k>3,(x,y)=(3k,4k),(4k,3k)是方程(xy)=k((x)+(y))的2个正整数解.证明了更为一般的结论:对于任意奇数k>3,当gcd(k,3)=1时,(x,y)=(3k,4k),(4k,3k)是方程(xy)=k((x)+(y))的2个正整数解.     

方程φe（n）= nd（e=1,2,4）的可解性

利用已有的广义欧拉函数的准确计算公式来研究方程φe(n)的可解性,其中n为正整数,d为n的正因子.并利用初等的方法和技巧给出方程φe(n)=n/d(e=1,2,4)的全部正整数解(n,d).     

一个有理分式Diophantine方程

本文研究了方程(x2-1)/(y2-1)=(z2-1)2.利用四次和二次方程的性质,获得了它的全部正整数解(x,y,z).     

一个包含Smarandache原函数的方程

设p为素数,n为任意正整数,我们定义Smarandache原函数S_p(n)为最小正整数k,使得p~n|k!,即S_p(n)=min{k∈N:p~n|k!}．本文利用初等方法研究了方程S_p(1)+S_p(2)+…+S_p(n)=S_p((n(n+1))/2)的可解性,并给出了该方程的所有正整数解．     

GLOBAL ATTRACTIVITY FOR AMULTIPLICATIVE DELAY DIFFERENTIAL POPULATION MODEL

1IntroductionInthispaper-wegiveasufficientconditionwhichguaranteestheg10balattractivityofthepositiveequilibriumofamu1tiplicativede1ayLogisticequation:wasproposedbyHutchinson[1]asamode1fortliegrowthofasing1especies.Equation(1.2)anditsgeneralizati0nhavereceivedandc0ntinuestoreceivegreatattenti0nssee,forexample[1,2,3,8].Inanattempttointroduceseveralenioronmentalnegativefeedbackeffects,manyau-thorshaveinvestigatedthefollowingequation[4,5,7]:However-itisn0tknownwhetherseveraleniv0ronmentalintraspe…     

Diophantine方程(a-1)x~2+f(a)=4a~n的一点注记

设a是大于1的正整数,f(a)是a的非负整系数多项式,f(1)=2rp+4,其中r是大于1的正整数,p=2~l-1是Mersenne素数.本文讨论了方程(a-1)x~2+f(a)=4a~n的正整数解(x,n)的有限性,并且证明了:当f(a)=91a+9时,该方程仅当a=5,7和25时分别有解(x,n)=(3,3),(11,3)和(3,4).     

Zeckendorf representations with at most two terms to x-coordinates of Pell equations

In this paper, we find all positive squarefree integers d satisfying that the Pell equation X~2-d Y~2=±1 has at least two positive integer solutions(X, Y) and(X′, Y′) such that both X and X′have Zeckendorf representations with at most two terms.     

关于数论函数方程φ(x_1…x_(n-1)x_n)=m(φ(x_1)+…+φ(x_(n-1))+φ(x_n))

运用Euler函数的性质证明了:当n>1时,方程φ(x_1…x_(n-1)x_n)=m(φ(x_1)+…+φ(x_(n-1))+φ(x_n))仅有有限多组正整数解(x_1,…,x_(n-1),x_n),得到了这些解都满足max{x_1,…,x_(n-1),x_n}≤2m⁴(n-1)4(n-1)²n2n².