ABSTRACT

In this paper, we prove a uniqueness theorem of meromorphic functions whose some nonlinear differential shares 1 IM with powers of the meromorphic functions, where the degrees of the powers are equal to those of the nonlinear differential polynomials. This result improves the corresponding one given by Zhang and Yang, and other authors.

Keywords:

Differential Polynomials, Meromorphic Functions, Uniqueness Theorems

1. Introduction

The meromorphic function mentioned in this paper refers to the meromorphic function over the entire complex plane. Let f and g be two non-constant meromorphic functions. $E\subset \left(0,\infty \right)$ means Linear measure finite set. $S\left(r,f\right)$ means $S\left(r,f\right)=o\left\{T\left(r,f\right)\right\},\left(r\to \infty ,r\notin E\right)$ . CM is the abbreviation of common multiplicities. And IM is the abbreviation of ignored multiplicities. These concepts can be found in the literature [1] . Let a be a finite complex number, if $f-a$ and $g-a$ have the same zero point and the same number of weights, then f and g CM share a. If $f-a$ and $g-a$ have the same zero point without counting the number, then f and g IM share a [2] . In addition, the following definitions are required: let p be a positive integer, and $a\in C\cup \left\{\infty \right\}$ . Next

$N_{p)}\left(r,\frac{1}{f-a}\right)$ means f has a weight less than p count function of the weight of the value point a within $\left|z\right|<r$ . ${\bar{N}}_{p)}\left(r,\frac{1}{f-a}\right)$ means corresponding reduced count function; $N_{(p}\left(r,\frac{1}{f-a}\right)$ means the weight of f is not less than p count function of the weight of the value point a within $\left|z\right|<r$ . ${\bar{N}}_{(p}\left(r,\frac{1}{f-a}\right)$ means corresponding reduced count function. Suppose k is a non-negative number. Mark $N_k\left(r,\frac{1}{f-a}\right)$ defined as follows. See the literature [3] for details.

$N_k\left(r,\frac{1}{f-a}\right)=\bar{N}\left(r,\frac{1}{f-a}\right)+{\bar{N}}_{(2}\left(r,\frac{1}{f-a}\right)+\cdot \cdot \cdot +{\bar{N}}_{(k}\left(r,\frac{1}{f-a}\right)$

Before, Xiaomin Li and Zhitao Wen expanded Jilong Zhang’s theorem, where ${\left(f^n\right)}^{\prime }$ changes to $f^{n-1}{f}^{\left(k\right)}$ , so when $k=1$ , that is Zhang’s theorem. Similarly, in this paper, we continuously change $f^{n-1}{f}^{\left(k\right)}$ to $f^{n-1}\left(f-1\right)f^{\left(k\right)}$ , which contained $f-1$ . So we expended Xiaomin Li and Zhitao Wen’s theorem.

In 2008, Lianzhong Yang and Jilong Zhang proved the following theorems:

Theorem A [4] Suppose f is a non-constant entire function, $n\ge 7$ is a positive integer, if $f^n$ and ${\left(f^n\right)}^{\prime }$ CM share 1, then $f^n={\left(f^n\right)}^{\prime }$ .

Theorem B [4] Suppose f is a non-constant meromorphic function, $n\ge 12$ is a positive integer, if $f^n$ and ${\left(f^n\right)}^{\prime }$ CM share 1, then $f^n={\left(f^n\right)}^{\prime }$ .

Recently Zhang Jilong improved the above theorem. Get the following result:

Theorem C [5] Suppose f is a non-constant entire function, $n\ge 3$ is a positive integer, if $f^n$ and ${\left(f^n\right)}^{\prime }$ CM share 1, then $f^n={\left(f^n\right)}^{\prime }$ .

Theorem D [5] Suppose f is a non-constant meromorphic function, $n\ge 4$ is a positive integer, if $f^n$ and ${\left(f^n\right)}^{\prime }$ CM share 1, then $f^n={\left(f^n\right)}^{\prime }$ .

Li Xiaomin and Wen Zhitao have improved on the basis of Zhang Jilong’s theorem, as follows.

Theorem E [5] Suppose f is a non-constant meromorphic function, k is a positive integer, n is a positive integer and satisfies $2n\ge k+3+\sqrt{k^2+2k+9}$ , if $f^n$ and ${\left(f^n\right)}^{\prime }$ CM share 1, then $f^n={\left(f^n\right)}^{\prime }$ .

Theorem F [5] Suppose f is a non-constant meromorphic function, k is a positive integer, n is a positive integer and satisfies $2n\ge 3k+8+\sqrt{9k^2+40k+64}$ , if $f^n$ and ${\left(f^n\right)}^{\prime }$ IM share 1, then $f^n={\left(f^n\right)}^{\prime }$ .

Now we mainly improve the theorem of Li Xiaomin. Which that changes $f^n$ and $f^{n-1}{f}^{\left(k\right)}$ to $f^n\left(f-1\right)$ and $f^{n-1}\left(f-1\right)f^{\left(k\right)}$ . We get the following theorem:

Theorem 1 Suppose f is a non-constant meromorphic function, k is a positive integer, n is a positive integer and satisfies $2n\ge 3k+13+\sqrt{9k^2+62k+129}$ , if $f^n\left(f-1\right)$ and $f^{n-1}\left(f-1\right)f^{\left(k\right)}$ IM share 1, and the zeros of $f-1$ with multiplicity 2 at least., then $f=f^{\left(k\right)}$ .

2. Some Lemmas

Lemma 1 [6] Suppose F and G are non-constant meromorphic functions, let

$H=\left(\frac{F^{″}}{F^{\prime }}-2\frac{F^{\prime }}{F-1}\right)-\left(\frac{G^{″}}{G^{\prime }}-2\frac{G^{\prime }}{G-1}\right)$

and suppose $H\ne 0$ , if F and G IM share 1, then

$N_E^{1)}\left(r,\frac{1}{G-1}\right)\le N\left(r,H\right)+S\left(r,F\right)+S\left(r,G\right)$

Lemma 2 [7] Let f be a non-constant meromorphic function, and

$P\left(f\right)=a_n{f}^n+a_{n-1}{f}^{n-1}+\cdot \cdot \cdot +a_{1}f$

where $a_1,a_2,\cdots ,a_{n-1},a_n\left(\ne 0\right)$ are constants, then $T\left(r,P\left(f\right)\right)=nT\left(r,f\right)+O\left(1\right)$ .

Lemma 3 Let f be a non-constant meromorphic function, $k\left(\ge 1\right)$ and $n\left(\ge 2\right)$ are two positive integers. Let $F=f^n\left(f-1\right)$ and $G=f^{n-1}\left(f-1\right)f^{\left(k\right)}$ . If F and G IM share 1, then $S\left(r,F\right)=S\left(r,G\right)=S\left(r,f\right)$ .

Proof According to Lemma 2, we obtain

$T\left(r,F\right)=\left(n+1\right)T\left(r,f\right)+O\left(1\right)$ (1)

It can be seen from the above formula,

$S\left(r,F\right)=S\left(r,f\right)$ (2)

due to $G=f^{n-1}\left(f-1\right)f^{\left(k\right)}$ , we have

$\begin{array}{c}T\left(r,G\right)\le \left(n-1\right)T\left(r,f\right)+T\left(r,f-1\right)+T\left(r,f^{\left(k\right)}\right)\\ \le \left(n-1\right)T\left(r,f\right)+T\left(r,f\right)+k\bar{N}\left(r,f\right)+S\left(r,f\right)\\ \le \left(n+k\right)T\left(r,f\right)+S\left(r,f\right)\end{array}$ (3)

According to the second basic theorem and (2)

$\begin{array}{c}T\left(r,F\right)\le \bar{N}\left(r,\frac{1}{F-1}\right)+\bar{N}\left(r,\frac{1}{F}\right)+\bar{N}\left(r,F\right)+S\left(r,F\right)\\ =\bar{N}\left(r,\frac{1}{G-1}\right)+\bar{N}\left(r,\frac{1}{f}\right)+\bar{N}\left(r,f\right)+S\left(r,f\right)\\ \le T\left(r,G\right)+2T\left(r,f\right)+S\left(r,f\right)\end{array}$

The above formula is combined with (1) to get

$T\left(r,G\right)\ge \left(n-1\right)T\left(r,f\right)+S\left(r,f\right)$ (4)

According to (3) and (4), we have

$S\left(r,G\right)=S\left(r,f\right)$ (5)

According to (2) and (5), we can get the conclusion of Lemma 3.

Lemma 4 [8] Let f be a non-constant meromorphic function, $k,p$ are two positive integers. The zero point of $f-1$ is at least 2, then

$N_p\left(r,\frac{1}{f^{\left(k\right)}}\right)\le k\bar{N}\left(r,f\right)+N_{p+k}\left(r,\frac{1}{f}\right)+S\left(r,f\right)$

$\bar{N}\left(r,\frac{1}{f-1}\right)\le N\left(r,\frac{f}{f^{\prime }}\right)\le \bar{N}\left(r,f\right)+\bar{N}\left(r,\frac{1}{f}\right)+S\left(r,f\right)$

Lemma 5 Let f be a non-constant meromorphic function, $n\left(\ge 2\right)$ , p are two positive integers. The zero point of $f-1$ is at least 2. Let $F=f^n\left(f-1\right)$ and $G=f^{n-1}\left(f-1\right)f^{\left(k\right)}$ , if F and G IM share 1, then

a) $\bar{N}\left(r,\frac{1}{G}\right)\le \left(k+3\right)\bar{N}\left(r,\frac{1}{f}\right)+\left(k+1\right)\bar{N}\left(r,f\right)+S\left(r,f\right)$

b) ${\bar{N}}_L\left(r,\frac{1}{F-1}\right)\le 2\bar{N}\left(r,\frac{1}{f}\right)+2\bar{N}\left(r,f\right)+S\left(r,f\right)$ ;

c) ${\bar{N}}_L\left(r,\frac{1}{G-1}\right)\le \left(k+3\right)\bar{N}\left(r,\frac{1}{f}\right)+\left(k+2\right)\bar{N}\left(r,f\right)+S\left(r,f\right)$ .

Proof According to Lemma 4, we have

$\begin{array}{c}\bar{N}\left(r,\frac{1}{G}\right)\le \bar{N}\left(r,\frac{1}{f}\right)+\bar{N}\left(r,\frac{1}{f-1}\right)+N_1\left(r,\frac{1}{f^{\left(k\right)}}\right)+S\left(r,f\right)\\ \le \bar{N}\left(r,\frac{1}{f}\right)+\bar{N}\left(r,f\right)+\bar{N}\left(r,\frac{1}{f}\right)+N_{k+1}\left(r,\frac{1}{f}\right)+k\bar{N}\left(r,f\right)+S\left(r,f\right)\\ \le \left(k+3\right)\bar{N}\left(r,\frac{1}{f}\right)+\left(k+1\right)\bar{N}\left(r,f\right)+S\left(r,f\right)\end{array}$

This leads to the conclusion (a), obtained from the definition of the $N_L\left(r,\frac{1}{F-1}\right)$ and Lemma 3:

$\begin{array}{c}{N}_L\left(r,\frac{1}{F-1}\right)\le N\left(r,\frac{F}{F^{\prime }}\right)\le T\left(r,\frac{F^{\prime }}{F}\right)+O\left(1\right)=m\left(r,\frac{F^{\prime }}{F}\right)+N\left(r,\frac{F^{\prime }}{F}\right)+O\left(1\right)\\ =\bar{N}\left(r,F\right)+\bar{N}\left(r,\frac{1}{F}\right)+S\left(r,F\right)=2\bar{N}\left(r,f\right)+2\bar{N}\left(r,\frac{1}{f}\right)+S\left(r,f\right)\end{array}$

This leads to conclusions (b), the same reason

${\bar{N}}_L\left(r,\frac{1}{G-1}\right)\le \bar{N}\left(r,\frac{1}{G}\right)+\bar{N}\left(r,G\right)+S\left(r,f\right)$

Combine $G=f^{n-1}\left(f-1\right)f^{\left(k\right)}$ and the q form in Lemma 5, we can get (c).

Lemma 6 Suppose F and G are non-constant meromorphic functions, and satisfy $\bar{N}\left(r,F\right)+\bar{N}\left(r,\frac{1}{F}\right)=S\left(r,F\right)$ and $\bar{N}\left(r,G\right)+\bar{N}\left(r,\frac{1}{G}\right)=S\left(r,G\right)$ . If F and G IM share a non-zero constant a, then $F=G$ or $FG=1$ .

Proof

Suppose $F=f^n\left(f-1\right)$ , $G=f^{n-1}\left(f-1\right)f^{\left(k\right)}$ . (6)

Let H be defined by Lemma 1. The following two discussions,

Case 1 Suppose $H\ne \text{0}$ , then $F\ne G$ , let

$V=\left(\frac{F^{\prime }}{F-1}-\frac{F^{\prime }}{F}\right)-\left(\frac{G^{\prime }}{G-1}-\frac{G^{\prime }}{G}\right)$ (7)

If $V=0$ ,

$1-\frac{1}{F}=B-\frac{B}{G}$ (8)

where $B\ne 0$ is a constant, if $\bar{N}\left(r,f\right)\ne S\left(r,f\right).$

By (6) and (8), we get $B=1$ .

So $F=G$ , contradictory with the assumption of case 1.

Therefore, $\bar{N}\left(r,f\right)=S\left(r,f\right)$ .

So $B\ne 1$ , by (8), we get

$G=\frac{BF}{\left(B-1\right)F+1}=\frac{BF}{F-\frac{1}{1-B}}\left(\frac{1}{B-1}\right)$ (9)

$\bar{N}\left(r,\frac{1}{F-\frac{1}{B-1}}\right)=S\left(r,f\right)$ (10)

According to the second basic theorem and (6) (8) (9) (10) we get

$\begin{array}{c}T\left(r,F\right)\le \bar{N}\left(r,\frac{1}{F}\right)+\bar{N}\left(r,\frac{1}{F-\frac{1}{B-1}}\right)+\bar{N}\left(r,F\right)+S\left(r,F\right)\\ \le \bar{N}\left(r,\frac{1}{f}\right)+\bar{N}\left(r,\frac{1}{f-1}\right)+S\left(r,f\right)\\ \le 2\bar{N}\left(r,f\right)+S\left(r,f\right)\end{array}$ (11)

By lemma 2, we have

$T\left(r,F\right)=\left(n+1\right)T\left(r,f\right)+O\left(1\right)$ (12)

Then

$\left(n+1\right)T\left(r,f\right)-3T\left(r,f\right)=S\left(r,f\right)$ (13)

If $B=1$ , then $F=G$ , contradiction.

If V was not always equal to 0, (7) can be rewritten into

$V=\frac{F^{\prime }}{F\left(F-1\right)}-\frac{G^{\prime }}{G\left(G-1\right)}$ (14)

Suppose $z_0$ is a pole of f with multiplicity p, then $z_0$ is pole of F with multiplicity $\left(n+1\right)p$ . and $z_0$ is zero of $\frac{F^{\prime }}{F\left(F-1\right)}$ with multiplicity $\left(n+1\right)p-1$ at least. $z_0$ is zero of $\frac{G^{\prime }}{G\left(G-1\right)}$ with multiplicity $\left(n+1\right)p+k-1$ at least.

So $z_0$ is a zero of V with multiplicity $\ge n$ at least.

$\begin{array}{c}n\bar{N}\left(r,f\right)\le N\left(r,\frac{1}{V}\right)+S\left(r,f\right)\le N\left(r,V\right)+S\left(r,f\right)\\ \le \bar{N}\left(r,\frac{1}{G}\right)+{\bar{N}}_L\left(r,\frac{1}{F-1}\right)+{\bar{N}}_L\left(r,\frac{1}{G-1}\right)+S\left(r,f\right)\\ \le \left(k+3\right)\bar{N}\left(r,\frac{1}{f}\right)+\left(k+1\right)\bar{N}\left(r,f\right)+2\bar{N}\left(r,f\right)\\ +2\bar{N}\left(r,\frac{1}{f}\right)+\left(k+3\right)\bar{N}\left(r,\frac{1}{f}\right)+\left(k+2\right)\bar{N}\left(r,f\right)+S\left(r,f\right)\\ \le \left(2k+8\right)\bar{N}\left(r,\frac{1}{f}\right)+\left(2k+5\right)\bar{N}\left(r,f\right)+S\left(r,f\right)\end{array}$

Then

$\left(n-2k-5\right)\bar{N}\left(r,f\right)\le \left(2k+8\right)\bar{N}\left(r,\frac{1}{f}\right)+S\left(r,f\right)$ (15)

The following two sub-cases are discussed:

Sub-case 1.1 suppose

$U=\frac{F^{\prime }}{F-1}-\frac{G^{\prime }}{G-1}$ (16)

If $U=0$ , we have

$F=DG+1-D$

where $D\ne 0$ is a constant. Then

$\bar{N}\left(r,f\right)=S\left(r,f\right)$ . (17)

Suppose $\bar{N}\left(r,\frac{1}{f}\right)\ne S\left(r,f\right)$ , $D=1$ , $F=G$ , contradiction;

Suppose $\bar{N}\left(r,\frac{1}{f-1}\right)\ne S\left(r,f\right)$ , $D=1$ , $F=G$ , contradiction.

So $\bar{N}\left(r,\frac{1}{f}\right)=S\left(r,f\right)$ , $\bar{N}\left(r,\frac{1}{f-1}\right)=S\left(r,f\right)$ . (18)

If $D\ne 1$ , $\bar{N}\left(r,\frac{1}{G}\right)=\bar{N}\left(r,\frac{1}{F+D-1}\right)$ ,

$\bar{N}\left(r,\frac{1}{G}\right)=\bar{N}\left(r,\frac{1}{f}\right)+\bar{N}\left(r,\frac{1}{f^{\left(k\right)}}\right)+\bar{N}\left(r,\frac{1}{f-1}\right)=S\left(r,f\right)$

So $\bar{N}\left(r,\frac{1}{F+D-1}\right)=S\left(r,f\right)$ .

Then

$\begin{array}{c}\left(n+1\right)T\left(r,f\right)=T\left(r,F\right)+S\left(r,f\right)\\ \le \bar{N}\left(r,\frac{1}{F}\right)+\bar{N}\left(r,\frac{1}{F+D-1}\right)+\bar{N}\left(r,F\right)+S\left(r,f\right)\\ =S\left(r,f\right)\end{array}$

Obviously impossible.

Suppose U is not always equal to 0, let $z_1$ be a zero of f with multiplicity q, then $z_1$ is a zero F with multiplicity nq and $z_1$ is zero of $\frac{F^{\prime }}{F-1}$ with multiplicity $nq-1$ at least. $z_0$ is zero of $\frac{G^{\prime }}{G-1}$ with multiplicity $\left(n-1\right)q-1$ at least.

So $z_1$ is a zero of U with multiplicity $n-2$ at least.

$\begin{array}{c}\left(n-2\right)\bar{N}\left(r,\frac{1}{f}\right)\le N\left(r,\frac{1}{U}\right)+S\left(r,f\right)\le N\left(r,U\right)+S\left(r,f\right)\\ \le \bar{N}\left(r,f\right)+{\bar{N}}_L\left(r,\frac{1}{F-1}\right)+{\bar{N}}_L\left(r,\frac{1}{G-1}\right)+S\left(r,f\right)\\ \le \left(k+5\right)\bar{N}\left(r,\frac{1}{f}\right)+\left(k+4\right)\bar{N}\left(r,f\right)+S\left(r,f\right)\end{array}$

So

$\left(n-k-7\right)\bar{N}\left(r,\frac{1}{f}\right)\le \left(k+5\right)\bar{N}\left(r,f\right)+S\left(r,f\right)$ (19)

Also

$\begin{array}{c}T\left(r,F\right)\le \bar{N}\left(r,\frac{1}{F}\right)+\bar{N}\left(r,\frac{1}{F-1}\right)+\bar{N}\left(r,F\right)+S\left(r,F\right)\\ \le 2\bar{N}\left(r,\frac{1}{f}\right)+2\bar{N}\left(r,f\right)+\bar{N}\left(r,\frac{1}{F-1}\right)+S\left(r,f\right)\end{array}$

$\begin{array}{c}\bar{N}\left(r,\frac{1}{F-1}\right)\le \bar{N}\left(r,\frac{1}{\frac{f^{n-1}\left(f-1\right)f^{\left(k\right)}}{f^n\left(f-1\right)}-1}\right)\le T\left(r,\frac{f^{\left(k\right)}}{f}\right)+S\left(r,f\right)\\ =m\left(r,\frac{f^{\left(k\right)}}{f}\right)+\bar{N}\left(r,\frac{f^{\left(k\right)}}{f}\right)+S\left(r,f\right)\\ \le k\bar{N}\left(r,f\right)+k\bar{N}\left(r,\frac{1}{f}\right)+S\left(r,f\right)\end{array}$

Then

$T\left(r,F\right)\le \left(k+2\right)\bar{N}\left(r,\frac{1}{f}\right)+\left(k+2\right)\bar{N}\left(r,f\right)+S\left(r,f\right)$ (20)

If $n-2k-5>0$ , and $\bar{N}\left(r,\frac{1}{f}\right)=S\left(r,f\right)$ , $\bar{N}\left(r,f\right)=S\left(r,f\right)$ one of the two forms is established. Then $\bar{N}\left(r,\frac{1}{f}\right)+\bar{N}\left(r,f\right)=S\left(r,f\right)$ , substituting the above formula is obviously impossible.

Or $T\left(r,F\right)=S\left(r,f\right)$ , contradiction.

So $\bar{N}\left(r,\frac{1}{f}\right)+\bar{N}\left(r,f\right)\ne S\left(r,f\right)$ , we get

$\bar{N}\left(r,\frac{1}{f}\right)\ne S\left(r,f\right),\bar{N}\left(r,f\right)\ne S\left(r,f\right)$ , then

$\left(n-k-7\right)\bar{N}\left(r,\frac{1}{f}\right)\le \frac{\left(k+4\right)\left(2k+8\right)}{n-2k-6}\bar{N}\left(r,\frac{1}{f}\right)+S\left(r,f\right)$

$\left(n-k-7\right)\le \frac{\left(k+4\right)\left(2k+8\right)}{n-2k-6}$

$\frac{3k+13-\sqrt{9k^2+62k+129}}{2}\le n\le \frac{3k+13+\sqrt{9k^2+62k+129}}{2}$ (21)

Case 2

Situation 2.1

If $\bar{N}\left(r,\frac{1}{f}\right)+\bar{N}\left(r,f\right)=S\left(r,f\right)$ , we get

$\bar{N}\left(r,\frac{1}{F}\right)+\bar{N}\left(r,F\right)=S\left(r,F\right)$ , $\bar{N}\left(r,\frac{1}{G}\right)+\bar{N}\left(r,G\right)=S\left(r,F\right)$

According to Lemma 6, we get $F=G$ or $FG=1$ .

Firstly, if $F=G$ , $f^n\left(f-1\right)=f^{n-1}\left(f-1\right)f^{\left(k\right)}$ , $f=f^{\left(k\right)}$ , conclusion established.

Secondly, if $FG=1$ , $f^n\left(f-1\right)\cdot f^{n-1}\left(f-1\right)f^{\left(k\right)}=1$ , $f^{2n-1}{\left(f-1\right)}^2{f}^{\left(k\right)}=1$ .

Obviously f is entire function.

And

$\begin{array}{c}T\left(r,f^{2n-1}\right)\le \bar{N}\left(r,\frac{1}{f^{\left(k\right)}}\right)+\bar{N}\left(r,\frac{1}{{\left(f-1\right)}^2}\right)+S\left(r,f\right)\\ =T\left(r,f\right)+2T\left(r,f\right)+S\left(r,f\right)\\ =3T\left(r,f\right)+S\left(r,f\right)\end{array}$

$\left(2n-1\right)T\left(r,f\right)\le 3T\left(r,f\right)+S\left(r,f\right)$

$T\left(r,f\right)=S\left(r,f\right)$ , contradiction.

Situation 2.2

If $\bar{N}\left(r,f\right)\ne S\left(r,f\right)$ , we get $B=0$ .

So $G-1=A\left(F-1\right)$ .

If $\bar{N}\left(r,f\right)\ne S\left(r,f\right)$ , we get $A=1$ , then $F=G$ .

And if $\bar{N}\left(r,f\right)=S\left(r,f\right)$ ,

$\begin{array}{c}T\left(r,F\right)\le \bar{N}\left(r,\frac{1}{f}\right)+\bar{N}\left(r,f\right)+\bar{N}\left(r,\frac{1}{f-1}\right)+\bar{N}\left(r,\frac{1}{F-1}\right)+S\left(r,f\right)\\ \le \left(k+2\right)\bar{N}\left(r,f\right)+S\left(r,f\right)\end{array}$

$\left(n+1\right)T\left(r,f\right)\le \left(k+2\right)\bar{N}\left(r,f\right)+S\left(r,f\right)$

We get $n\le k+1$ , that contradict with $2n\ge 3k+13+\sqrt{9k^2+62k+129}$ .

Suppose $\bar{N}\left(r,f\right)=S\left(r,f\right)$ ,

If $\bar{N}\left(r,\frac{1}{f}\right)\ne S\left(r,f\right)$ we get $B=A-1$ .

If $A=1$ , we get $B=0$ , then $F=G$ .

If $A\ne 1$ , we get

$F-1=\frac{G-1}{G-\frac{1}{A-1}}\left(\frac{1}{A-1}\right)$

$\bar{N}\left(r,f\right)=\bar{N}\left(r,G\right)=\bar{N}\left(r,\frac{1}{G-\frac{1}{A-1}}\right)=S\left(r,f\right)$

And $T\left(r,F\right)=T\left(r,G\right)+O(1)$

$\begin{array}{c}\left(n+1\right)T\left(r,f\right)=T\left(r,F\right)+O\left(1\right)=T\left(r,G\right)\\ \le \bar{N}\left(r,G\right)+\bar{N}\left(r,\frac{1}{G}\right)+\bar{N}\left(r,\frac{1}{G-\frac{1}{A-1}}\right)+S\left(r,f\right)\\ \le \bar{N}\left(r,\frac{1}{G}\right)+S\left(r,f\right)\le \left(k+3\right)\bar{N}\left(r,\frac{1}{f}\right)+S\left(r,f\right)\end{array}$

We get $n\le k+2$ , which contradicts with $2n\ge 3k+13+\sqrt{9k^2+62k+129}$ .

Therefore, Theorem 1 is proved.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

Cite this paper

Tao, J. and Wang, X.L. (2018) Uniqueness of Meromorphic Functions Whose Differential Polynomials Share One Value. Journal of Applied Mathematics and Physics, 6, 2264-2272. https://doi.org/10.4236/jamp.2018.611188

References