Background

Gottfried Leibniz and Guilliaume L’Höpital sparked initial curiosity into the theory of fractional calculus during a 1695 correspondence on the possible value and meaning of non-integer-order derivatives. By the late nineteenth century, the combined efforts of a number of mathematicians most notably Liouville, Grünwald, Letnikov, and Riemann produced a fairly solid theory of fractional calculus for functions of a real variable. Though several viable fractional derivatives were proposed, the so-called Riemann-Liouville and Caputo derivatives are the two most commonly used today. Mathematicians have employed this fractional calculus in recent years to model and solve a variety of applied problems. Indeed, as Podlubney outlines in[1], fractional calculus aids significantly in the fields of viscoelasticity, capacitor theory, electrical circuits, electro-analytical chemistry, neurology, diffusion, control theory, and statistics.

The continuous fractional calculus has seen tremendous growth within the last 10 years or so. Some of the recent progress in the continuous fractional calculus has included a paper in which the authors explored a continuous fractional boundary value problem of conjugate type, using cone theory, they then deduced the existence of one or more positive solutions[2]. Of particular interest, with regard to the present paper, is the recent work by Benchohra et al.[3]. In that paper, the authors considered a continuous fractional differential equation with nonlocal conditions. Other recent work in the direction of those articles may be found, for example, in[414].

A recent interest in discrete fractional calculus has been shown by many scholars, such as Atici and Eloe, who in[15] discuss properties of the generalized falling function, a corresponding power rule for fractional delta-operators and the commutivity of fractional sums. They present in[16] more rules for composing fractional sums and differences. At the same time, a number of papers have appeared, and these have begun to build up the theoretical foundations of the discrete fractional calculus; for example, a recent paper by Atici and Eloe[17] explores some of the theories of a discrete conjugate fractional boundary value problem. Discrete fractional initial value problems were considered in a paper by Atici and Eloe[18] and a paper by the present author[19]. The other recent work may be found in[2033].

Goodrich in[20] considered a discrete fractional boundary value problem of the form

Δ ν y ( t ) = f ( t , y ( t + ν 1 ) ) , y ( ν 2 ) = 0 , y ( ν + b ) = g ( y ) ,

wheret [ 0 , b ] N 0 :={0,1,,b}f: [ ν 2 , ν 1 , , ν + b 1 ] N ν 2 ×RR is a continuous function,g:C( [ ν 2 , ν + b ] N ν 2 ,R) is a given function, and 1 < ν ≤ 2. He also established the existence and uniqueness of solution to this problem by the contraction mapping theorem, the Brouwer theorem, and the Guo-Krasnosel’kii theorem.

Holm[21] examined the fractional boundary value problem

Δ ν μ ν y ( t ) = f ( t , y ( t + ν 1 ) ) , for t { 0 , , b + M } , Δ i y ( ν N ) = 0 , for i { 0 , , N 2 } , Δ ν N μ y ( b + M + ν μ ) = 0 ,

where

  1. (1)

    ν ≥ 2, with NNℕ chosen so that N − 1 < νN.

  2. (2)

    1≤μ < ν, with MN chosen so that M − 1 < ν ≤ M.

  3. (3)
    bN

    .

  4. (4)

    f is {0,1,···,b+M}×RR is continuous and nonnegative for y ≥ 0.

Motivated by all the works above, in this paper, we discuss the existence and uniqueness of solutions to a discrete fractional boundary value problem

Δ ν μ ν y ( t ) = f ( t , y ( t + ν 1 ) ) , for t { 0 , , b + M } , y ( ν N ) = = y ( ν 3 ) = 0 , y ( ν 2 ) = g ( y ) , Δ ν N μ y ( b + M + ν μ ) = 0 ,
(1)

where

  1. (1)

     ν ≥ 2, with NN chosen so that N − 1 < ν ≤ N.

  2. (2)

    1 ≤ μ < ν, with MN chosen so that M − 1 <ν ≤M.

  3. (3)
    bN

    .

  4. (4)

    f is {0,1,···,b+M}×RR is continuous and nonnegtive for y ≥ 0.

  5. (5)

    y is {νN,,b+M+ν}R.

  6. (6)

    g is C([νN,,b+M+ν],R) is a given function.

First, we will give the form of solutions of problem 1, and then we will prove the existence and uniqueness of solution to this problem by the contraction mapping theorem and the Brouwer theorem. Lastly, we give some examples to illustrate the main results.

Preliminaries

For the convenience of the reader, we give some background materials from fractional difference theory to facilitate analysis of problem 1. These and other related results and their proof can be found in[1518].

Definition 1

We define t ν ̲ := Γ ( t + 1 ) Γ ( t + 1 ν ) , for any t and ν for which the right-hand side is defined. We also appeal to the convention that if t + 1 − ν is a pole of the Gamma function and t + 1 is not a pole, then t ν ̲ =0.

Definition 2

The νth fractional sum of a function f, for ν > 0, is defined by

Δ ν f ( t ; a ) : = 1 Γ ( ν ) s = a t ν ( t s 1 ) ν 1 ̲ f ( s ) ,

fort{a+ν,a+ν+1,···}= N a + ν . We also define the νth fractional difference for ν> 0 by Δνf(t) = ΔNΔν − Nf(t), wheret N a + ν andνN is chosen so that 0 ≤ N − 1 <ν ≤N.

Lemma 1

Let ν be any positive real number and a b be two real numbers such that ν < a ≤ b[17]. Then the following are valid.

  1. (1)
    1 x ν ̲

    is a decreasing function for x ( 0 , ) N .

  2. (2)
    ( a x ) ν ̲ ( b x ) ν ̲

    is a decreasing function for x [ 0 , a ν ) N .

Lemma 2

If x < y < t + 1, then t x ̲ < t y ̲ .

Proof

By definition, we get

t x ̲ t y ̲ = Γ ( t + 1 ) Γ ( t + 1 x ) Γ ( t + 1 ) Γ ( t + 1 y ) = Γ ( t + 1 y ) Γ ( t + 1 x ) ,

in view of x < y, then

Γ ( t + 1 y ) Γ ( t + 1 x ) < 1 ,

thus

t x ̲ < t y ̲ .

Lemma 3

Letf: N a R and ν > 0 be given with N −1 <ν ≤ N[21]. Consider the νth-order fractional difference equation

Δ a + ν N ν y(t)=f(t),t N a
(2)

and the corresponding ν th-order fractional initial value problem

Δ a + ν N ν = f ( t ) , for t N a , Δ i y ( a + ν N ) = A i , for i { 0 , 1 , · · · , N 1 } , A i R
(3)

.

The general solution to equation 2 is

y(t)= i = 0 N 1 α i ( t a ) i + ν N ̲ + Δ a ν f(t),t N a + ν N ,
(4)

where { α i } i = 0 N 1 are N real constants. Moreover, the unique solution to Equation 3 is Equation 4 with particular constants

α i = p = 0 i k = 0 i p ( 1 ) k i ! ( i k ) N ν ̲ i p i p k A p ,

for i ∈{0,1,…,N−1}.

Lemma 4

LetaR and μ>0 be given[21]. Then

Δ ( t a ) μ ̲ = μ ( t a ) ( μ 1 ) ̲ ,

for any t, for which both sides, are well-defined. Furthermore, for ν> 0,

Δ a + μ ν ( t a ) μ ̲ = μ ν ̲ ( t a ) ( μ + ν ) ̲ , t N a + μ + ν

and

Δ a + μ ν ( t a ) μ ̲ = μ ν ̲ ( t a ) ( μ ν ) ̲ , t N a + μ + N ν .

Lemma 5

Letf: N a R be given[21]. For any ν > 0, μ > 0 with M< μ < M + 1 we have

Δ ν Δ a μ f ( t ) = Δ a ν μ f ( t ) , for t N a + μ ,
Δ ν Δ a μ f ( t ) = Δ a ν + μ f ( t ) , for t N a + M μ .

Lemma 6

For t and s, for which both ( t s 1 ) ν ̲ and ( t s 2 ) ν ̲ are defined[19], we find that

Δ s [ ( t s 1 ) ν ̲ ] = ν ( t s 2 ) ν 1 ̲ .

Lemma 7

A function y is a solution of problem 1 if and only if y(t),t [ ν N , b + M + ν ] N ν N , has the form

y ( t ) = g ( y ) Γ ( ν 1 ) t ν 2 ̲ + δ ( ν μ 1 ) g ( y ) Γ ( ν ) ( b + M + 2 ) t ν 1 ̲ 1 Γ ( ν ) s = 0 t ν ( t σ ( s ) ) ν 1 ̲ f ( s , y ( s + ν 1 ) ) ,

where

σ ( s ) = s + 1 , δ = Γ ( ν μ ) Δ 0 μ ν f ( b + M + ν μ , y ( b + M + 2 ν μ 1 ) ) Γ ( ν ) ( b + M + ν μ ) ν μ 1 ̲ .

Proof

From Lemma 3, we get

y ( t ) = i = 0 N 1 α i t i + ν N ̲ Δ 0 ν f ( t , y ( t + ν 1 ) ) ,

where α i R,t [ ν N , b + M + ν ] N ν N .

By the boundary conditions

y ( ν N ) = y ( ν N + 1 ) = ... = y ( ν 3 ) = 0 , y ( ν 2 ) = g ( y ) ,

we have

Δ 0 ν f ( t , y ( t + ν 1 ) ) | t = ν N + k = 1 Γ ( ν ) s = 0 t ν ( t σ ( s ) ) ν 1 ̲ f ( s , y ( s + ν 1 ) ) | t = ν N + k = 1 Γ ( ν ) s = 0 N + k ( ν N + k σ ( s ) ) ν 1 ̲ f ( s , y ( s + ν 1 ) ) = 0 ,

for each k∈{0,1,···,N−3}, we conclude that

0 = y ( ν N + k ) = i = 0 N 1 α i ( ν N + k ) i + ν N ̲ Δ 0 ν f ( ν N + k , y ( 2 ν N + k 1 ) ) = i = 0 N 1 α i Γ ( ν N + k + 1 ) Γ ( k i + 1 ) = i = 0 k α i Γ ( ν N + k + 1 ) ( k i ) ! .

Solving the system of N−2 equations for { α i } i = 0 N 3 , we obtain

α 0 = α 1 = · · · = α N 3 = 0 .

Hence, the general solution to the problem 1 simplifies nicely to

y ( t ) = α N 2 t ν 2 ̲ + α N 1 t ν 1 ̲ Δ 0 ν f ( t , y ( t + ν 1 ) ) .

From y(ν−2)=g(y),we get

α N 2 ( ν 2 ) ν 2 ̲ + α N 1 ( ν 2 ) ν 1 ̲ Δ 0 ν f ( ν 2 , y ( 2 ν 3 ) ) = g ( y ) .

Since

Δ 0 ν f ( ν 2 , y ( 2 ν 3 ) ) = s = 0 t ν ( t σ ( s ) ) ν 1 ̲ f ( s , y ( s + ν 1 ) ) | t = ν 2 = 0 ,

then

Γ ( ν 1 ) α N 2 = g ( y ) ,

thus, we obtain

α N 2 = g ( y ) Γ ( ν 1 ) .

From Lemma 4 and Lemma 5, we get

Δ ν N μ y ( t ) = α N 2 Δ ν N μ t ν 2 ̲ + α N 1 Δ ν N μ t ν 1 ̲ Δ ν N μ Δ 0 ν f ( t , y ( t + ν 1 ) ) = α N 2 Δ ν 2 μ t ν 2 ̲ + α N 1 Δ ν 1 μ t ν 1 ̲ Δ ν μ Δ 0 ν f ( t , y ( t + ν 1 ) ) = α N 2 ( ν 2 ) μ ̲ t ν μ 2 ̲ + α N 1 ( ν 1 ) μ ̲ t ν μ 1 ̲ Δ ν μ Δ 0 ν f ( t , y ( t + ν 1 ) ) = α N 2 Γ ( ν 1 ) Γ ( ν μ 1 ) t ν μ 2 ̲ + α N 1 Γ ( ν ) Γ ( ν μ ) t ν μ 1 ̲ Δ 0 μ ν f ( t , y ( t + ν 1 ) ) .

In view of

Δ ν N μ y ( b + M + ν μ ) = 0 ,

we get

0 = Δ ν N μ y ( b + M + ν μ ) = α N 2 Γ ( ν 1 ) Γ ( ν μ 1 ) ( b + M + ν μ ) ν μ 2 ̲ + α N 1 Γ ( ν ) Γ ( ν μ ) ( b + M + ν μ ) ν μ 1 ̲ Δ 0 μ ν f ( b + M + ν μ , y ( b + M + 2 ν μ 1 ) ) ,

then, we get

g ( y ) Γ ( ν μ 1 ) ( b + M + ν μ ) ν μ 2 ̲ + α N 1 Γ ( ν ) Γ ( ν μ ) ( b + M + ν μ ) ν μ 1 ̲ Δ 0 μ ν f ( b + M + ν μ , y ( b + M + 2 ν μ 1 ) ) = 0 ,

thus,

α N 1 = Γ ( ν μ ) Δ 0 μ ν f ( b + M + ν μ , y ( b + M + 2 ν μ 1 ) ) Γ ( ν ) ( b + M + ν μ ) ν μ 1 ̲ ( ν μ 1 ) g ( y ) Γ ( ν ) ( b + M + 2 ) .

Then, we obtain

y ( t ) = g ( y ) Γ ( ν 1 ) t ν 2 + Γ ( ν μ ) Δ 0 μ ν f ( b + M + ν μ , y ( b + M + 2 ν μ 1 ) ) Γ ( ν ) ( b + M + ν μ ) ν μ 1 ̲ ( ν μ 1 ) g ( y ) Γ ( ν ) ( b + M + 2 ) t ν 1 Δ 0 ν f ( t , y ( t + ν 1 ) ) .

Let

δ= Γ ( ν μ ) Δ 0 μ ν f ( b + M + ν μ , y ( b + M + 2 ν | ! μ 1 ) ) Γ ( ν ) ( b + M + ν μ ) ν μ 1 ̲ .
(5)

We get

y ( t ) = g ( y ) Γ ( ν 1 ) t ν 2 + δ ( ν μ 1 ) g ( y ) Γ ( ν ) ( b + M + 2 ) t ν 1 1 Γ ( ν ) s = 0 t ν ( t σ ( s ) ) ν 1 ̲ f ( s , y ( s + ν 1 ) ) .
(6)

This show that if problem 1 has a solution, then it can be represented by Equation 6 and that every function of form Equation 6 is a solution of problem 1, which completes the proof.

Results and discussion

In this section, we wish to show that under certain conditions, problem 1 have at least one solution. We notice that problem 1 may be recast an equivalent summation equation. In particular, y is a solution of problem 1 if and only if y is a fixed point of the operatorT: R b + M + N + 1 R b + M + N + 1 , where

( Ty ) ( t ) : = t ν 2 ̲ Γ ( ν 1 ) g ( y ) + δ t ν 1 ̲ ( ν μ 1 ) t ν 1 ̲ Γ ( ν ) ( b + M + 2 ) g ( y ) 1 Γ ( ν ) s = 0 t ν ( t σ ( s ) ) ν 1 ̲ f ( s , y ( s + ν 1 ) ) ,
(7)

fort [ ν N , b + M + ν ] N ν N , where this observation follows from Lemma 7. We now use this fact to prove our first existence theorem.

Theorem 1

Definey= sup t [ ν N , b + M + ν ] N ν N y(t). Suppose that f(t,y) and g(y) are Lipschitz in y. That is, there exist α,β>0 such that |f(t,y1)−f(t,y2)|≤α|y1y2|, |g(y1)−g(y2)|≤β|y1y2| whenever y1,y2R. Then it follows that problem 1 has a unique solution provided that the condition

0 < α j = 1 b + M ( ν + j j ) + β ( b + M + ν ) ν 2 ̲ Γ ( ν 1 ) + β ( ν μ 1 ) ( b + M + ν ) ν 1 ̲ Γ ( ν ) ( b + M + 2 ) < 1
(8)

holds.

Proof

We will show that T is a contraction mapping. To this end, we notice that for given y1 and y2, □

T y 1 T y 2 β y 1 y 2 max t [ ν N , b + M + ν ] t ν 2 ̲ Γ ( ν 1 ) + β y 1 y 2 max t [ ν N , b + M + ν ] ( ν μ 1 ) t ν 1 ̲ Γ ( ν ) ( b + M + 2 ) + α y 1 y 2 max t [ ν N , b + M + ν ] 1 Γ ( ν ) s = 0 t ν ( t σ ( s ) ) ν 1 .
(9)

We now analyze each of the three terms on the right-hand side of proof 9.

Firstly, by an application of Lemma 6, we get

1 Γ ( ν ) s = 0 t ν ( t σ ( s ) ) ν 1 = 1 Γ ( ν ) 1 ν ( t s ) ν ̲ s = 0 t ν + 1 = Γ ( t + 1 ) Γ ( ν + 1 ) Γ ( t + 1 ν ) Γ ( b + M + ν + 1 ) Γ ( b + M + 1 ) Γ ( ν + 1 ) = j = 1 b + M ν + j j .
(10)

Secondly, by Lemma 1,

( ν μ 1 ) t ν 1 ̲ Γ ( ν ) ( b + M + 2 ) ( ν μ 1 ) ( b + M + ν ) ν 1 ̲ Γ ( ν ) ( b + M + 2 ) .
(11)

Finally, from another application of Lemma 1, we obtain

t ν 2 ̲ Γ ( ν 1 ) ( b + M + ν ) ν 2 ̲ Γ ( ν 1 ) .
(12)

So, putting inequalities 10,11,12 in Equation 9, we conclude that

T y 1 T y 2 α j = 1 b + M ( ν + j j ) + β ( b + M + ν ) ν 2 ̲ Γ ( ν 1 ) + β ( ν μ 1 ) ( b + M + ν ) ν 1 ̲ Γ ( ν ) ( b + M + 2 ) y 1 y 2 .

Therefore, by requiring condition 8 to hold, we find that problem 1 has a unique solution. And this completes the proof.

By weakening the conditions imposed on f(t,y) and g(y), we can still deduce the existence of a solution to problem 1. We will apply the Brouwer theorem to accomplish this.

Theorem 2

Suppose that there exists a constantK>2δ ( b + M + ν ) ν 1 ̲ such that f(t,y) satisfies the inequality

max ( t , y ) [ 0 , b + M ] N 0 × [ K , K ] |f(t,y)| K δ ( b + M + ν ) ν 1 ̲ m 1 + m 2 + m 3
(13)

and g(y) satisfies the inequality

max y [ K , K ] |g(y)| K δ ( b + M + ν ) ν 1 ̲ m 1 + m 2 + m 3 ,
(14)

where

m 1 = 1 Γ ( ν ) s = 0 b + M ( b + M + ν σ ( s ) ) ν 1 ̲

, m 2 = ( b + M + ν ) ν 2 ̲ Γ ( ν 1 ) , m 3 = | ν μ 1 | ( b + M + ν ) ν 2 ̲ Γ ( ν ) , δ is defined as in 5.

Then problem 1 has at least one solution, y0, satisfying |y0|≤K, for allt [ ν N , b + M + ν ] N ν N .

Consider the Banach spaceB:={y R b + M + N + 1 :yK}. Let T be the operator defined in Equation 7. It is clear that T is a continuous operator. Therefore, the main objective in establishing this result is to show thatT:BB. That is, whenever ∥y∥≤K, it follows that ∥Ty∥≤K. Once this is established, the Brouwer theorem will be invoked to deduce the conclusion.

To this end, assume that inequalities in 13 and 14 hold for given f and g. For convenience, we let

Ω:= K δ ( b + M + ν ) ν 1 ̲ m 1 + m 2 + m 3 ,
(15)

which is a strictly positive constant. Using the notation introduced in 15, we have

Ty max t [ ν N , b + M + ν ] N ν N t ν 2 ̲ Γ ( ν 1 ) | g ( y ) | + δ max t [ ν N , b + M + ν ] N ν N t ν 1 ̲ + max t [ ν N , b + M + ν ] N ν N | ν μ 1 | t ν 1 ̲ Γ ( ν ) ( b + M + 2 ) | g ( y ) | + max t [ ν N , b + M + ν ] N ν N × 1 Γ ( ν ) s = 0 t ν ( t σ ( s ) ) ν 1 ̲ | f ( t , y ( s + ν 1 ) ) | Ω max t [ ν N , b + M + ν ] N ν N t ν 2 ̲ Γ ( ν 1 ) + δ ( b + M + ν ) ν 1 ̲ + Ω max t [ ν N , b + M + ν ] N ν N | ν μ 1 | t ν 1 ̲ Γ ( ν ) ( b + M + 2 ) + Ω max t [ ν N , b + M + ν ] N ν N 1 Γ ( ν ) s = 0 t ν ( t σ ( s ) ) ν 1 ̲ .
(16)

Now, much as in the proof of Theorem 1, we can simplify the expression on the right-hand side of inequality 16. Indeed, we know that

1 Γ ( ν ) s = 0 t ν ( t σ ( s ) ) ν 1 ̲ 1 Γ ( ν ) s = 0 b + M ( b + M + ν σ ( s ) ) ν 1 ̲ = m 1 ,
(17)
t ν 2 ̲ Γ ( ν 1 ) ( b + M + ν ) ν 2 ̲ Γ ( ν 1 ) = m 2 ,
(18)
| ν μ 1 | t ν 1 ̲ Γ ( ν ) ( b + M + 2 ) | ν μ 1 | ( b + M + ν ) ν 2 ̲ Γ ( ν ) = m 3 .
(19)

We now put inequalities in 18,19,20 together, we get

TyΩ( m 1 + m 2 + m 3 )+δ ( b + M + ν ) ν 1 ̲ K.
(20)

Thus, from Equation 20 we deduce thatT:BB, as desired. Consequently, it follows at once by the Brouwer theorem that there exists a fixed point of the map T, say T y0=y0, with y 0 B. So this function y0 is a solution of problem 1. Moreover, y0satisfies the bound |y0(t)|≤K for eacht [ ν N , b + M + ν ] N ν N . Thereby, this completes the proof of the theorem.

Example

In this section, we will present some examples to illustrate the main results.

Example 1.

Suppose thatν= 7 3 , b=1, M=2,μ= 5 4 and N=3. Letf(t,y):= sin y 50 + | t | andg(y):= 1 50 cosy. Then problem 1 becomes

Δ 13 12 7 3 y ( t ) = sin ( y ( t + 4 3 ) ) 50 + | t + 4 3 | , for t { 0 , ... , 3 } , y ( 2 3 ) = 0 , Δy ( 2 3 ) = 1 50 cos ( y ( t + 4 3 ) ) , Δ 2 3 5 4 y ( 49 12 ) = 0 .
(21)

In this case, inequality 8 is

0 < α j = 1 b + M ( ν + j j ) + β ( b + M + ν ) ν 2 ̲ Γ ( ν 1 ) + β ( ν μ 1 ) ( b + M + ν ) ν 1 ̲ Γ ( ν ) ( b + M + 2 ) = α j = 1 3 ( 7 3 + j j ) + β 16 3 1 3 ̲ Γ ( 4 3 ) + β 1 12 × 16 3 4 3 ̲ Γ ( 7 3 ) × 5 < 13 α + 39 2 β.
(22)

In addition, f and g are with Lipschitz constantα=β= 1 50 . So, for these choices α and β, problem 22 is satisfied. Therefore, from Theorem 1 we deduce that problem 21 has a unique solution.

Example 2.

Suppose thatν= 9 4 , b=8, M=2,μ= 5 4 , N=3 and K=1,000. Letf(t,y):= 1 100 texp{ 1 100 y 2 } andg(y):= i = 1 n c i y( t i ), t i [ ν N , ν + b + M ] N ν N . Then problem 1 is

Δ 1 9 4 y ( t ) = 1 100 t exp { 1 100 y 2 ( t + 5 4 ) } , for t { 0 , · · · , 3 } , y ( 3 4 ) = 0 , Δy ( 3 4 ) = i = 1 n c i y ( t i + 5 4 ) , Δ 3 4 5 4 y ( 11 ) = 0 ,
(23)

so, the Banach spaceB:={y R 14 :y1,000}.

For

m 1 = 1 Γ ( 9 4 ) s = 0 10 ( 10 + 9 4 σ ( s ) ) 5 4 ̲ 60 ,
m 2 = ( 10 + Γ ( 9 4 ) 1 4 ̲ Γ ( 5 4 ) 11 , m 3 = 0 ,
δ ( b + M + ν ) ν 1 ̲ 500 ,

thus

K δ ( b + M + ν ) ν 1 ̲ m 1 + m 2 + m 3 500 60 + 11 25 4 .
(24)

It is clear thatf(t,y) 49 400 < 25 4 . And if we require

i = 1 n | c i | 1 10000 ,
(25)

then from 25, foryB,g(y) 1 10 < 25 4 so that f and g satisfy the conditions. Thus, by Theorem 2, we deduce that problem 23 has at least one solutions.

Endnotes

This research is supported by the Natural Science Foundation of China (11071143, 60904024, 61174217), Natural Science Outstanding Youth Foundation of Shandong Province (JQ201119) and supported by Shandong Provincial Natural Science Foundation (ZR2010AL002, ZR2009AL003), also supported by Natural Science Foundation of Educational Department of Shandong Province (J11LA01).