The recursive sequence xn+1 = g(xn,xn−1)/(A + xn)

In this note, we investigate the periodic character of solutions of the nonlinear, second-order difference equation

where the parameter A and the initial conditions x₀ and x₁ are positive real numbers. We give sufficient conditions under which every positive solution of this equation converges to a period two solution.     

Iteration xn+1=αn+1f(xn) + (1 - αn+1)Tn+1xn for an Infinite Family of Nonexpansive Maps {Tn}∞n=1

Under the framework of uniformly smooth Banach spaces, Chang[1] proved in 2006 that the sequence {xn} generated by the iteration xn+1 = αn+1f(xn) + (1 - αn+1)Tn+1xn converges strongly to a common fixed point of a finite family of nonexpansive maps {Tn}, where f : C → C is a contraction. However, in this paper, the author considers the iteration in more general case that {Tn} is an infinite family of nonexpansive maps, and proves that Chang's result holds still in the setting of reflexive Banach spaces with the weakly sequentially continuous duality mapping.     

差分方程xn+1=xn+xαn/nβ解的渐近性

我们研究差分方程(1)的解的渐近性和全局吸引性.     

On the Behavior of Solutions of x n+1 = p+(x n−1/xn )

Our goal in this article is to complete the study of the behavior of solutions of the equation in the title when the parameter p is positive and the initial conditions are arbitrary positive numbers. Our main focus is the case 0 < p < 1. We will show that in this case, all solutions which do not monotonically converge to the equilibrium have a subsequence which converges to p and a subsequence which diverges to infinity. For the sake of completeness, we will also present the results (which were previously known) with alternative proofs for the case p = 1 and the case p > 1.     

Stability of solutions for the recursive sequence xn+1=(α-βxn)/(γ+g(xn-k))

In this paper, we investigate the global behavior of the recursive sequence$x_{n+1}=\frac{\alpha -\beta x_n}{\gamma +g(x_{n-k})}\mathrm{for}n=0,1,\dots ,$where $\alpha ,\beta ,\gamma ⩾0$ and $g(x)$ is a continuous function defined on $(-\infty ,\infty )$, which satisfies some additional conditions.     

A Note on the Recursive Sequence x n + 1 = p k x n + p k − 1 x n − 1 +...+ p 1 x n − k + 1

We present some comments on the behavior of solutions of the difference equation where p _i 0, i = 1,..., k, k N, and x _–k ,..., x _–1 R.     

条件"x+y=1"下1/xn+λ/yn的最小值

1　问题的提出我们经常遇到下列问题 :(1)已知 x,y∈ R ,且 x y =1,求 1x 4y 的最小值 ;(2 )已知 x,y∈ R ,且 x y =1,求 1x2 8y2 的最小值 ;问题 (1)“用 1代换”不难求得 :1x 4y =(1x 4y) (x y)　　 =5 yx 4 xy ≥ 5 2 yx .4 xy =9,当且仅当 yx =4 xy,即　 y =2 x时取等号 .问题 (2 )能否“用 1代换”呢 ?1x2 8y2 =(1x2 8y2 ) (x y) ,　 =1x 8y yx2 8xy2 ,虽然有　 1x 8y ≥ 2 8xy ,yx2 8xy2 ≥ 2 8xy 且　 1xy≥ 2x y,但三式等号分别在 y =8x,y =2 x与 y =x时成立 ,故等号不能同时成立 .在 (1x…     

关于xn+1在Q[x]上分解的探讨

从特殊情况研究多项式f(x)=x<'n>+1在有理域Q[x]上的因式分解情况.可以证明:f(x)不可约的充要条件是存在自然数q,使得n=2<'q>;多项式f(x)的因式数不小于n的奇子数加1,即D(f)≥H(n)+1;如果n是素数,那么D(f)=H(n)+1.     

差分方程xn+1=xanern(1-xn-k)正解的渐近性

本文研究时滞Logistic方程 xn+1=xanern(1-xn-k),n=0,1,2,… (*) 其中rn是非负实数列,a∈(0,1],k为非负整数,获得了保证方程(*)的每一正解趋于1的一些充分条件,推广和改进了文[1]的结果.     

关于xn+1在Q[x]上分解的探讨

从特殊情况研究多项式f(x)=x<'n>+1在有理域Q[x]上的因式分解情况.可以证明:f(x)不可约的充要条件是存在自然数q,使得n=2<'q>;多项式f(x)的因式数不小于n的奇子数加1,即D(f)≥H(n)+1;如果n是素数,那么D(f)=H(n)+1.