共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
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. 相似文献
3.
Peter M. Knopf 《Journal of Difference Equations and Applications》2013,19(7):607-619
Consider the third-order difference equation x n+1 = (α+βx n +δx n ? 2)/(x n ? 1) with α ∈ [0,∞) and β,δ ∈ (0,∞). It is shown that this difference equation has unbounded solutions if and only if δ>β. 相似文献
4.
In this study, we determine when the Diophantine equation x 2?kxy+y 2?2 n = 0 has an infinite number of positive integer solutions x and y for 0 ? n ? 10. Moreover, we give all positive integer solutions of the same equation for 0 ? n ? 10 in terms of generalized Fibonacci sequence. Lastly, we formulate a conjecture related to the Diophantine equation x 2 ? kxy + y 2 ? 2 n = 0. 相似文献
5.
设n是正整数.本文证明了:方程(n+1)+(n+2)y=nz仅当n=3时有正整数解(y,z)=(1,2). 相似文献
6.
7.
Xing-Xue Yan Wan-Tong Li Zhu Zhao 《Journal of Applied Mathematics and Computing》2005,17(1-2):269-282
We study the global asymptotic stability, global attractivity, boundedness character, and periodic nature of all positive solutions and all negative solutions of the difference equation $$x_{n + 1} = \alpha - \frac{{x_n }}{{x_{n - 1} }}, n = 0,1,...,$$ where α∈R is a real number, and the initial conditionsx?1,x 0 are arbitrary real numbers. 相似文献
8.
Let n be a positive odd integer. In this paper, combining some properties of quadratic and quartic diophantine equations with elementary analysis, we prove that if n > 1 and both 6n 2 ? 1 and 12n 2 + 1 are odd primes, then the general elliptic curve y 2 = x 3+(36n 2?9)x?2(36n 2?5) has only the integral point (x, y) = (2, 0). By this result we can get that the above elliptic curve has only the trivial integral point for n = 3, 13, 17 etc. Thus it can be seen that the elliptic curve y 2 = x 3 + 27x ? 62 really is an unusual elliptic curve which has large integral points. 相似文献
9.
10.
11.
12.
François Apéry 《Comptes Rendus Mathematique》2010,348(9-10):479-482
13.
Giovanni Gaiffi 《manuscripta mathematica》1996,91(1):83-94
Let
be the complexified Coxeter arrangement of hyperplanes of typeA
n−1. In this paper we construct anS
n+1 extension of the naturalS
n action on the complex cohomology ring of the complement ofA
n−1. Recurrence formulas connecting characters with respect to theS
n and theS
n+1 action are given. 相似文献
14.
In this paper we prove that the equation (2
n
– 1)(6
n
– 1) = x
2 has no solutions in positive integers n and x. Furthermore, the equation (a
n
– 1) (a
kn
– 1) = x
2 in positive integers a > 1, n, k > 1 (kn > 2) and x is also considered. We show that this equation has the only solutions (a,n,k,x) = (2,3,2,21), (3,1,5,22) and (7,1,4,120). 相似文献
15.
Chebyshev determined $$\mathop {\min }\limits_{(a)} \mathop {\max }\limits_{ - 1 \le x \le 1} |x^n + a_1 x^{n - 1} + \cdots + a_n |$$ as 21?n , which is attained when the polynomial is 21?n T n(x), whereT n(x) = cos(n arc cosx). Zolotarev's First Problem is to determine $$\mathop {\min }\limits_{(a)} \mathop {\max }\limits_{ - 1 \le x \le 1} |x^n - n\sigma x^{n - 1} + a_2 x^{n - 2} + \cdots + a_n |$$ as a function ofn and the parameter σ and to find the extremal polynomials. He solved this in 1878. Another discussion was given by Achieser in 1928, and another by Erdös and Szegö in 1942. The case when 0≤|σ|≤ tan2(π/2n) is quite simple, but that for |σ|> tan2(π/2n) is quite different and very complicated. We give two new versions of the proof and discuss the change in character of the solution. Both make use of the Equal Ripple Theorem. 相似文献
16.
B.D. Mestel 《Journal of Difference Equations and Applications》2013,19(2):201-209
We study the second-order difference equation x n +1 = f ( x n ) x n m 1 where f ] C 1 ([0, X ),[0, X )) and x n ] (0, X ) for all n ] Z . For the cases p h 5, we find necessary and sufficient conditions on f for all solutions to be periodic with period p . We answer some questions and conjectures of Kulenovi ' and Ladas. 相似文献
17.
18.
卢安然 《数学的实践与认识》2023,(11):265-270
通过利用pell方程、递归序列、平方剩余、Legendre符号、同余关系等初等证明方法,并利用Mathematica软件对Legendre符号等进行计算,证明了方程3x(x+1)(x+2)(x+3)=10y(y+1)(y+2)(y+3)共有16组整数解,并且无正整数解. 相似文献
19.
谢耀兵 《数学的实践与认识》2022,(5):246-249
运用pell方程、递归序列、二次平方剩余的方法,并使用数学软件Mathematica的计算,求出了丢番图方程5x(x+1)(x+2)(x+3)=9y(y+1)(y+2)(y+3)的所有20组整数解,其中只有一组正整数解为(x,y)=(6,5). 相似文献