共查询到20条相似文献，搜索用时 281 毫秒
1.
乔宗敏 《重庆大学学报(英文版)》2005,4(2):121-124
1 Introduction 1 Let X as a compact metric space with the metric d and f :X → Xas a continuous map. For every nonnegative integer n , define f ninductively by f n = f ? f n?1, with f 0as the identity map on X . If there is a positive integer n such that f n( x )= x, the point x of X is called the periodic point of f and the least n is called the periodic point of x . A periodic point is called a fixed point. Denote the fixed points set and the periodic points set of f respectively by F ( f… 相似文献
2.
LI Yun-tong CAO Yao 《重庆大学学报(英文版)》2007,6(4):283-286
The uniqueness problem of entire functions sharing one small function was studied. By Picard’s Theorem, we proved that for two transcendental entire functions f (z) and g(z), a positive integer n≥9, and a(z) (not identically eaqual to zero) being a common small function related to f (z) and g(z), if f n(z)(f(z)-1)f′(z) and gn(z)(g(z)-1)g′(z) share a(z) CM, where CM is counting multiplicity, then g(z) ≡ f (z). This is an extended version of Fang and Hong’s theorem [ Fang ML, Hong W, A unicity theorem for entire functions concerning differential polynomials, Journal of Indian Pure Applied Mathematics, 2001, 32 (9): 1343-1348]. 相似文献
3.
INTRODUCTION The Morse-Sard theorem is a fundamentaltheorem in analysis, especially in the basis oftransversality theory and differential topology. Theclassical Morse-Sard theorem states that the imageof the set of critical points of a function f: Rm→Rnof class Cm ?n 1 has zero Lebesgue measure in Rn. Itwas proved by Morse (1939) in the case n =1andby Sard (1942) in general case. So it is called. Due to its theoretical importance, the Morse-Sard theorem was generalize… 相似文献
4.
LAI Li-ping LI Chun-hong 《重庆大学学报(英文版)》2007,6(4):278-282
The uniqueness of meromorphic fuctions sharing one value was studied. Using the concept of weighted sharing, we proved the following theorem. For two meromorphic functions f and g which are not polynominals of degree less than a positive integer k, if f nf (k) and g ng (k) share (1,2), where n is another positive integer not less than k 10, then f nf (k) identically equals g ng (k) or f nf (k)g ng (k) identically equals 1. Particularly for k =1, we improved the results of Yang [Yang CC, Hua XH, Uniqueness and value-sharing of meromorphic functions, Annales Academi? Scientiarum Fennic? Mathematica, 1997, 22: 395-406], and Fang [Fang ML, Hua XH, Entire function that share one value, Journal of Nanjing University, 1996, 13(1): 44-48. (In Chinese)]. 相似文献
5.
费振鹏 《数理天地(高中版)》2003,(9)
一、试题原文1. For each integer n > 1, let p(n) denote the largest prime factor of n. Determine all triples x,y,z of distinct positive integers satisfying(i) x,y,z are in arithmetic progression and(ii) p(xyz)≤3.2. Let ABC be a triangle and let D be a point on AB such that 4AD = AB. The half - line l is drawn on the same side of AB as C, starting from D and making an angle of θwith DA where θ=∠ACB. If the 相似文献
6.
段曦盛 《重庆大学学报(英文版)》2003,2(2)
Introduction Let f and g be two meromorphic functions defined in the open complex plane C, and k be a nonnegative integer or infinity. For {}aC违U, denote by (;)kEaf the set of all a-points of f where an a-point of multiplicity m is counted m times if mk and otherwise k+1 times. If (;)(;)kkEafEag=, then, f and g are considered to share the value a with weight k, which is expressed by f and g share (a ,k). Clearly if f and g share (a ,k), then they share (a ,p) for all integer p in 0pk#. It… 相似文献
7.
WANG Wei-xiang SHANG You-lin ZHANG Lian-sheng 《浙江大学学报(A卷英文版)》2006,7(12):2083-2087
INTRODUCTION Considering the following nonlinear integer programming problem: (PI) min f(x), s.t. x∈XI, (1) where XI?In is a bounded and closed box set con- taining more than one point, In is the set of integer points in n . If we suppose that f(x) satisfies the following conditions: if x∈XI, then f(x)=f(x), otherwise f(x)= ∞, then Problem PI is equal to the following nonlinear integer programming problem (UPI) min f(x), s.t. x∈In. (2) The formulation in PI allows the set XI t… 相似文献
8.
《零陵学院学报》1991,(3)
In this paper we study the Oscillatory behaviour of the second order delay differenceequation.(1)△(r_n△A_n)+P_nA_(n-k)=0,n=n_0,n_0+1……where{P_n}(?)is a nonnegative Sequenceof real number,(?)is a positive sequence of real number with sum from n=n_0 to +∞(1/r_n)=+∞,K is a positive integer and △A_n=A_(n+1)-A_n we prove that each one of following conditions.imples that al solutions of Eq(1)oscillate,where R_(n)=sum from i=n_0 to n(1/r_i)j 相似文献
9.
《中学数学月刊》2003,(10)
Question 1(a) If f(x+x-1 ) =x3 +x-3 ,determine the function f(x) .(b) Solve the equation2 3 log1 0 x 5 log1 0 x =16 0 0 .(c) L etf(x) =(m2 - 1) x2 +(m- 1) x+n+2 ,(m≠ 1) ,be an odd function and m and n areconstants.Determine whether g(x) =xm +xn is an even or an odd function,or neither.Question 2(a) Express 5 sinθ+12 cosθ in the form Rsin(θ+α) ,where R is positive andα is acute.(b) If sinα+cosα=13,andα∈ (0 ,π) ,determine sin3 α- cos3 α.(c) Ues the relationship eiθ=cosθ+isinθ … 相似文献
10.
In this paper, a new method named as the gradually descent method was proposed to solve the discrete global optimization problem. With the aid of an auxiliary function, this method enables to convert the problem of finding one discrete minimizer of the objective function f to that of finding another at each cycle. The auxiliary function can ensure that a point, except a prescribed point, is not its integer stationary point if the value of objective function at the point is greater than the scalar which is chosen properly. This property leads to a better minimizer of f found more easily by some classical local search methods. The computational results show that this algorithm is quite efficient and reliable for solving nonlinear integer programming problems. 相似文献
11.
讨论了一般微分单项式的值分布 ,得到定理 :设 f 是平面上的超越亚纯函数 .F=fn0 (f( i) ) ni… (f( k) ) nk-c,ni≥ 1,c≠ 0是常数 ,那么 (n0 -2 ) T(r,f )≤ N(r,1F ) S(r,f ) n0 >2T(r,f )≤ 7(i 1)i (Ni) (r,1f ) N(r,1F) ) S(r,f ) n0 =1T(r,f )≤ 7(N (r,1f ) N(r,1F) ) S(r,f ) n0 =0 . 相似文献
12.
张梅 《渭南师范学院学报》2012,(2):23-24
设Ω（n）表示正整数n的全部素因子的个数,即若n=PlαlP2α2…pr^αr,其中Pi（1≤i≤r）是不同的素数,则Ω（n）=α＋α2＋…＋α,．文章主要利用初等方法探讨Ω（n）的二次均值,并给出∑a≤x^Ω2（x）的渐近公式． 相似文献
13.
管训贵 《黄冈师范学院学报》2012,32(6):10-11
对于正实数x,设π（x）表示适合p≤x的素数p的个数.对于正整数k、n,设fk（n）=π（x）＋π（2kx）＋…＋π（nkx）及Sk（n）=1k＋2k＋…＋nk.证明了：当x≥4且n≥[（k＋1）e1.2]时,fk（n）≥π（Sk（n）x）. 相似文献
14.
设D是无平方因子正奇数.本文证明了:当D不能被6k+1之形素数整除时,如果方程x3-33m=Dy2有适合gcd(x,Y)=1的正整数解(x,y,m),则D≡7(mod 8),D的素因数p都满足了p≡11(mod 12),而且D的素因数个数必为奇数. 相似文献
15.
设p是奇素数 ,D是无平方因子正整数 .本文证明了 :当p >3时 ,如果D不能被p或 2kp + 1之形素数整除 ,则方程xp 2 p=pDy2 没有适合gcd(x,y) =1的正整数解 (x,y) . 相似文献
16.
郑惠 《绵阳师范学院学报》2012,31(8):11-13,17
设p是素数,k为自然数,d>1为奇数。该文运用初等方法证明了不定方程x(x+d)(x+2d)(x+3d)=p2ky(y+d)(y+2d)(y+3d)没有正整数解。 相似文献
17.
利用除数函数的性质及初等方法,得到了一系列重要结论:(1)任何素数都是优美指数;(2)若t=2s-s-1(s为非负整数)或t=2s.3-s-1(s为非负整数)或t=2sp-s-2(s为非负整数,p为奇素数)或t=p1p2…ps-s-1(s为大于1的正整数,p1,p2,…,ps为适合p13),则pt都是优美指数。 相似文献
18.
设x,y,z是正整数.若x2+y2=z2,则称(x,y,z)是一组Pythagoras数.本文运用初等方法证明了:(1)恰有12组Pythagoras数(x,y,z)满足2p(x,y,z)=xy,其中p为奇素数;(2)恰有36组Pythagoras数(x,y,z)满足2pq(x+y+z)=xy,其中p,q均为奇素数,且p相似文献
19.
乐茂华 《韩山师范学院学报》2002,23(2):1-2,5
证明了 :方程 (x3 - 1) / (x - 1) =(yn- 1) / (y - 1) ,x >y >1,n >3,仅有正整数解 (x ,y ,n) =( 5,2 ,5)和 ( 90 ,2 ,13)分别满足条件 gcd(x ,y) =1和y|x。 相似文献
20.
乐茂华 《周口师范学院学报》2004,21(2):4-5
设p是奇素数,D是无平方因子正整数.本文证明了: 当p＞3时,如果D不能被p或2kp 1之形素数整除,则方程xp-2p=Dy2没有适合gcd(x, y)=1的正整数解(x, y). 相似文献