Abstract

The aim of this paper is to offer a generalization of the Philos and Staikos lemma. As a possible application of the lemma in the oscillation theory, we study the asymptotic properties and oscillation of the 𝑛 th order delay differential equations ( 𝐸 ) ( π‘Ÿ ( 𝑑 ) [ π‘₯ ( 𝑛 βˆ’ 1 ) ( 𝑑 ) ] 𝛾 ) ξ…ž + π‘ž ( 𝑑 ) π‘₯ 𝛾 ( 𝜏 ( 𝑑 ) ) = 0 . The results obtained utilize also the comparison theorems.

1. Introduction

In this paper, we will study the asymptotic and oscillation behavior of the solutions of the higher-order advanced differential equations: ξ€· ξ€Ί π‘₯ π‘Ÿ ( 𝑑 ) ( 𝑛 βˆ’ 1 ) ξ€» ( 𝑑 ) 𝛾 ξ€Έ ξ…ž + π‘ž ( 𝑑 ) π‘₯ 𝛾 ( 𝜏 ( 𝑑 ) ) = 0 . ( 𝐸 )

Throughout the paper, we will assume π‘ž , 𝜏 , π‘Ÿ ∈ 𝐢 ( [ 𝑑 0 , ∞ ) ) , and ( 𝐻 1 ) 𝑛 β‰₯ 3 , 𝛾 is the ratio of two positive odd integers, ( 𝐻 2 ) π‘Ÿ ( 𝑑 ) > 0 , π‘ž ( 𝑑 ) > 0 , 𝜏 ( 𝑑 ) ≀ 𝑑 , l i m 𝑑 β†’ ∞ 𝜏 ( 𝑑 ) = ∞ .

Whenever, it is assumed ξ€œ 𝑅 ( 𝑑 ) = 𝑑 𝑑 0 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑠 ) d 𝑠 ⟢ ∞ a s 𝑑 ⟢ ∞ . ( 1 . 1 )

By a solution of ( 𝐸 ) we mean a function π‘₯ ( 𝑑 ) ∈ 𝐢 𝑛 βˆ’ 1 ( [ 𝑇 π‘₯ , ∞ ) ) ,   𝑇 π‘₯ β‰₯ 𝑑 0 , which has the property π‘Ÿ ( 𝑑 ) ( π‘₯ ( 𝑛 βˆ’ 1 ) ( 𝑑 ) ) 𝛾 ∈ 𝐢 1 ( [ 𝑇 π‘₯ , ∞ ) ) and satisfies   ( 𝐸 ) on [ 𝑇 π‘₯ , ∞ ) . We consider only those solutions π‘₯ ( 𝑑 ) of ( 𝐸 ) which satisfy s u p { | π‘₯ ( 𝑑 ) | ∢ 𝑑 β‰₯ 𝑇 } > 0 for all 𝑇 β‰₯ 𝑇 π‘₯ . We assume that ( 𝐸 ) possesses such a solution. A solution of ( 𝐸 ) is called oscillatory if it has arbitrarily large zeros on [ 𝑇 π‘₯ , ∞ ) , and otherwise it is called to be nonoscillatory.

The problem of the oscillation of higher-order differential equations has been widely studied by many authors, who have provided many techniques for obtaining oscillatory criteria for studied equations (see, e.g., [1–19]).

Philos and Staikos lemma (see [16, 17]) essentially simplifies the examination of 𝑛 th-order differential equations of the form 𝑦 ( 𝑛 ) ( 𝑑 ) + π‘ž ( 𝑑 ) 𝑦 𝛾 ( 𝜏 ( 𝑑 ) ) = 0 , ( 1 . 2 ) since it provides needed relationship between 𝑦 ( 𝑑 ) and 𝑦 ( 𝑛 βˆ’ 1 ) ( 𝑑 ) , and this fact permit us to establish just one condition for asymptotic behavior of (1.2). If we try to apply the Philos and Staikos lemma to ( 𝐸 ) , the strong condition π‘Ÿ β€² ( 𝑑 ) β‰₯ 0 appears (see, e.g., [2, 18, 20]). In this paper we offer such generalization of the Philos and Staikos lemma, where this restriction is relaxed. Moreover, the obtained lemma yields many applications in the oscillation theory. As an example of it, we offer its disposal in the comparison theory and we establish new oscillation criteria for ( 𝐸 ) .

2. Main Results

The following result is a well-known lemma of Kiguradze, see, for example, [6] or [13].

Lemma 2.1. Let 𝑧 ( 𝑑 ) ∈ 𝐢 π‘˜ βˆ’ 1 ( [ 𝑑 0 , ∞ ) ) and π‘Ÿ ( 𝑑 ) ( 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ) 𝛾 ∈ 𝐢 1 ( [ 𝑑 0 , ∞ ) ) with 𝑧 ( 𝑑 ) > 0 , ( π‘Ÿ ( 𝑑 ) ( 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ) 𝛾 ) ξ…ž ≀ 0 , and not identically zero on a subray of [ 𝑑 0 , ∞ ) . Then there exist a 𝑑 1 β‰₯ 𝑑 0 and an integer β„“ , 0 ≀ β„“ ≀ π‘˜ βˆ’ 1 , with π‘˜ + β„“ odd so that ( βˆ’ 1 ) β„“ + 𝑗 𝑧 ( 𝑗 ) 𝑧 ( 𝑑 ) > 0 , 𝑗 = β„“ , … , π‘˜ βˆ’ 1 , ( 𝑖 ) ( 𝑑 ) > 0 , 𝑖 = 1 , … , β„“ βˆ’ 1 , 𝑀 β„Ž 𝑒 𝑛 β„“ > 1 , ( 2 . 1 ) on [ 𝑑 1 , ∞ ) .

Now we are prepared to provide a generalization of the Philos and Staikos lemma.

Lemma 2.2. Let 𝑧 ( 𝑑 ) be as in Lemma 2.1 and numbers 𝑑 1 and β„“ assigned to 𝑧 ( 𝑑 ) by Lemma 2.1. Then for 0 < β„“ < π‘˜ βˆ’ 1 , π‘Ÿ 𝑧 ( 𝑑 ) β‰₯ 1 / 𝛾 ( 𝑑 ) 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ( ξ€œ π‘˜ βˆ’ 2 ) ! 𝑑 𝑑 1 π‘Ÿ βˆ’ 1 / 𝛾 ξ€· ( 𝑠 ) 𝑠 βˆ’ 𝑑 1 ξ€Έ π‘˜ βˆ’ 2 d 𝑠 , ( 2 . 2 ) for β„“ = π‘˜ βˆ’ 1 ; π‘Ÿ 𝑧 ( 𝑑 ) β‰₯ 1 / 𝛾 ( 𝑑 ) 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ( ξ€œ π‘˜ βˆ’ 2 ) ! 𝑑 𝑑 1 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑠 ) ( 𝑑 βˆ’ 𝑠 ) π‘˜ βˆ’ 2 d 𝑠 , ( 2 . 3 ) for 𝑑 β‰₯ 𝑑 1 .

Proof. Let β„“ be the integer assigned to function 𝑧 ( 𝑑 ) as in Lemma 2.1. Assume that β„“ < π‘˜ βˆ’ 1 , then, for any 𝑠 , 𝑑 with 𝑑 β‰₯ 𝑠 β‰₯ 𝑑 1 , βˆ’ 𝑧 ( π‘˜ βˆ’ 2 ) ( ξ€œ 𝑠 ) β‰₯ 𝑑 𝑠 𝑧 ( π‘˜ βˆ’ 1 ) ( ξ€œ 𝑒 ) d 𝑒 = 𝑑 𝑠 π‘Ÿ 1 / 𝛾 ( 𝑒 ) 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑒 ) π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑒 ) d 𝑒 β‰₯ π‘Ÿ 1 / 𝛾 ( 𝑑 ) 𝑧 ( π‘˜ βˆ’ 1 ) ( ξ€œ 𝑑 ) 𝑑 𝑠 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑒 ) d 𝑒 . ( 2 . 4 ) Repeated integration in 𝑠 from 𝑠 to 𝑑 yields 𝑧 ( β„“ ) ( 𝑠 ) β‰₯ π‘Ÿ 1 / 𝛾 ( 𝑑 ) 𝑧 ( π‘˜ βˆ’ 1 ) ξ€œ ( 𝑑 ) 𝑑 𝑠 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑒 ) ( 𝑒 βˆ’ 𝑠 ) π‘˜ βˆ’ 2 βˆ’ β„“ ( π‘˜ βˆ’ 2 βˆ’ β„“ ) ! d 𝑒 . ( 2 . 5 ) On the other hand, if β„“ β‰₯ 1 , then, for every 𝑑 β‰₯ 𝑑 1 , 𝑧 ( β„“ βˆ’ 1 ) ( ξ€œ 𝑑 ) β‰₯ 𝑑 𝑑 1 𝑧 ( β„“ ) ( 𝑠 ) d 𝑠 . ( 2 . 6 ) Repeated integration from 𝑑 1 to 𝑑 leads to 1 𝑧 ( 𝑑 ) β‰₯ ξ€œ ( β„“ βˆ’ 1 ) ! 𝑑 𝑑 1 𝑧 ( β„“ ) ( 𝑠 ) ( 𝑑 βˆ’ 𝑠 ) β„“ βˆ’ 1 d 𝑠 . ( 2 . 7 ) Setting (2.5) into (2.7), one gets π‘Ÿ 𝑧 ( 𝑑 ) β‰₯ 1 / 𝛾 ( 𝑑 ) 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ( ξ€œ β„“ βˆ’ 1 ) ! ( π‘˜ βˆ’ β„“ βˆ’ 2 ) ! 𝑑 𝑑 1 ( 𝑑 βˆ’ 𝑠 ) β„“ βˆ’ 1 ξ€œ 𝑑 𝑠 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑒 ) ( 𝑒 βˆ’ 𝑠 ) π‘˜ βˆ’ 2 βˆ’ β„“ β‰₯ π‘Ÿ d 𝑒 d 𝑠 1 / 𝛾 ( 𝑑 ) 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ( ξ€œ π‘˜ βˆ’ 3 ) ! 𝑑 𝑑 1 ξ€œ 𝑑 𝑠 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑒 ) ( 𝑒 βˆ’ 𝑠 ) π‘˜ βˆ’ 3 = π‘Ÿ d 𝑒 d 𝑠 1 / 𝛾 ( 𝑑 ) 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ξ€œ ( π‘˜ βˆ’ 2 ) ! 𝑑 𝑑 1 π‘Ÿ βˆ’ 1 / 𝛾 ξ€· ( 𝑒 ) 𝑒 βˆ’ 𝑑 1 ξ€Έ π‘˜ βˆ’ 2 d 𝑠 . ( 2 . 8 ) We have verified the first part of the lemma. Now assume that β„“ = π‘˜ βˆ’ 1 . It follows from (2.7) that 1 𝑧 ( 𝑑 ) β‰₯ ξ€œ ( π‘˜ βˆ’ 2 ) ! 𝑑 𝑑 1 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑠 ) ( 𝑑 βˆ’ 𝑠 ) π‘˜ βˆ’ 2 β‰₯ 1 d 𝑒 ξ€œ ( π‘˜ βˆ’ 2 ) ! 𝑑 𝑑 1 π‘Ÿ 1 / 𝛾 ( 𝑠 ) 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑠 ) π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑠 ) ( 𝑑 βˆ’ 𝑠 ) π‘˜ βˆ’ 2 = π‘Ÿ d 𝑠 1 / 𝛾 ( 𝑑 ) 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ξ€œ ( π‘˜ βˆ’ 2 ) ! 𝑑 𝑑 1 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑠 ) ( 𝑑 βˆ’ 𝑠 ) π‘˜ βˆ’ 2 d 𝑠 . ( 2 . 9 ) The proof is complete now.

Employing additional conditions, we are able to joint (2.5) and (2.7) to just one estimate.

Lemma 2.3. Let 𝑧 ( 𝑑 ) be as in Lemma 2.1 and l i m 𝑑 β†’ ∞ 𝑧 ( 𝑑 ) β‰  0 . Let π‘Ÿ ξ…ž ( 𝑑 ) β‰₯ 0 ,  Then for any πœ† ∈ ( 0 , 1 ) there exists some 𝑑 πœ† β‰₯ 𝑑 1 such that πœ† 𝑧 ( 𝑑 ) β‰₯ 𝑑 ( π‘˜ βˆ’ 1 ) ! π‘˜ βˆ’ 1 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) , ( 2 . 1 0 ) for 𝑑 β‰₯ 𝑑 πœ† .

Proof. Note that π‘Ÿ β€² ( 𝑑 ) β‰₯ 0 implies that π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑑 ) is nonincreasing. Assume that β„“ is the integer associated with 𝑧 ( 𝑑 ) in Lemma 2.1. If 0 < β„“ < π‘˜ βˆ’ 1 , then using (2.2), we have 𝑧 𝑧 ( 𝑑 ) β‰₯ ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ( ξ€œ π‘˜ βˆ’ 2 ) ! 𝑑 𝑑 1 ξ€· 𝑠 βˆ’ 𝑑 1 ξ€Έ π‘˜ βˆ’ 2 𝑧 d 𝑠 = ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ( ξ€· π‘˜ βˆ’ 1 ) ! 𝑑 βˆ’ 𝑑 1 ξ€Έ π‘˜ βˆ’ 1 . ( 2 . 1 1 ) It is easy to see that for any πœ† ∈ ( 0 , 1 ) there exists a 𝑑 πœ† β‰₯ 𝑑 1 such that 𝑑 βˆ’ 𝑑 1 β‰₯ πœ† 1 / ( π‘˜ βˆ’ 1 ) 𝑑 for 𝑑 β‰₯ 𝑑 πœ† , which in view of (2.11) yields (2.10).
If β„“ = π‘˜ βˆ’ 1 , then proceeding similarly as above it can be shown that (2.3) implies (2.10).
If β„“ = 0 , then it follows from (2.5) that 𝑧 ( 𝑠 ) β‰₯ π‘Ÿ 1 / 𝛾 ( 𝑑 ) 𝑧 ( π‘˜ βˆ’ 1 ) ξ€œ ( 𝑑 ) 𝑑 𝑠 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑒 ) ( 𝑒 βˆ’ 𝑠 ) π‘˜ βˆ’ 2 𝑧 ( π‘˜ βˆ’ 2 ) ! d 𝑒 = ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ( π‘˜ βˆ’ 1 ) ! ( 𝑑 βˆ’ 𝑠 ) π‘˜ βˆ’ 1 . ( 2 . 1 2 ) Setting 𝑠 = ( 1 βˆ’ πœ† 1 / 2 ( π‘˜ βˆ’ 1 ) ) 𝑑 , we have π‘₯ ξ€· ξ€· 1 βˆ’ πœ† 1 / 2 ( π‘˜ βˆ’ 1 ) ξ€Έ 𝑑 ξ€Έ β‰₯ 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) ( πœ† π‘˜ βˆ’ 1 ) ! 1 / 2 𝑑 π‘˜ βˆ’ 1 . ( 2 . 1 3 ) Moreover, l i m 𝑑 β†’ ∞ π‘₯ ( 𝑑 ) π‘₯ ξ€· ξ€· 1 βˆ’ πœ† 1 / 2 ( π‘˜ βˆ’ 1 ) ξ€Έ 𝑑 ξ€Έ = 1 > πœ† 1 / 2 . ( 2 . 1 4 ) Therefore, for all large 𝑑 , π‘₯ ( 𝑑 ) β‰₯ πœ† 1 / 2 π‘₯ ξ€· ξ€· 1 βˆ’ πœ† 1 / 2 ( π‘˜ βˆ’ 1 ) ξ€Έ 𝑑 ξ€Έ β‰₯ πœ† 𝑑 ( π‘˜ βˆ’ 1 ) ! π‘˜ βˆ’ 1 𝑧 ( π‘˜ βˆ’ 1 ) ( 𝑑 ) . ( 2 . 1 5 ) The proof is complete now.

In the following result, we compare (2.2) and (2.3) to verify that both estimates are independent; that is, one does not result from the other, although for π‘Ÿ ( 𝑑 ) ≑ 1 they are equivalent.

Remark 2.4. Let 𝑧 ( 𝑑 ) be as in Lemma 2.1, such that 𝑧 ( 𝑑 ) is increasing. At first we consider π‘Ÿ ( 𝑑 ) = 𝑑 3 , 𝛾 = 3 , 𝑑 1 = 1 , and π‘˜ = 3 then (2.2), (2.3), and (2.10) yield 𝑧 ( 𝑑 ) β‰₯ 𝑧 ξ…ž ξ…ž ξ€· 𝑑 ( 𝑑 ) 2 ξ€Έ βˆ’ 𝑑 l n 𝑑 βˆ’ 𝑑 , 𝑧 ( 𝑑 ) β‰₯ 𝑧 ξ…ž ξ…ž ξ€· 𝑑 ( 𝑑 ) 2 l n 𝑑 βˆ’ 𝑑 2 ξ€Έ + 𝑑 , 𝑧 ( 𝑑 ) β‰₯ 𝑧 ξ…ž ξ…ž ( 𝑑 ) πœ† 𝑑 2 2 , ( 2 . 1 6 ) respectively.
Now we modify π‘Ÿ ( 𝑑 ) = 𝑑 βˆ’ 3 . Then (2.2) and (2.3) reduce to 𝑧 ( 𝑑 ) β‰₯ 𝑧 ξ…ž ξ…ž ξ‚΅ 𝑑 ( 𝑑 ) 2 3 βˆ’ 𝑑 2 + 1 ξ‚Ά 6 𝑑 , 𝑧 ( 𝑑 ) β‰₯ 𝑧 ξ…ž ξ…ž ξ‚΅ 𝑑 ( 𝑑 ) 2 6 βˆ’ 1 2 + 1 ξ‚Ά 3 𝑑 , ( 2 . 1 7 ) respectively, and (2.10) is not applicable.

3. Applications

Lemma 2.2 can be applied in various techniques for investigations of the higher-order differential equations. We offer one such application in comparison theory.

Theorem 3.1. Assume that both first-order delay differential equations 𝑦 β€² ( 𝑑 ) + π‘ž ( 𝑑 ) ( ( 𝑛 βˆ’ 2 ) ! ) 𝛾 ξ‚΅ ξ€œ 𝑑 𝜏 ( 𝑑 ) 1 π‘Ÿ βˆ’ 1 / 𝛾 ξ€· ( 𝑠 ) 𝑠 βˆ’ 𝑑 1 ξ€Έ 𝑛 βˆ’ 2 ξ‚Ά d 𝑠 𝛾 ξ€· 𝐸 𝑦 ( 𝜏 ( 𝑑 ) ) = 0 , 1 ξ€Έ 𝑦 β€² ( 𝑑 ) + π‘ž ( 𝑑 ) ( ( 𝑛 βˆ’ 2 ) ! ) 𝛾 ξ‚΅ ξ€œ 𝑑 𝜏 ( 𝑑 ) 1 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑠 ) ( 𝜏 ( 𝑑 ) βˆ’ 𝑠 ) 𝑛 βˆ’ 2 ξ‚Ά d 𝑠 𝛾 𝑦 ξ€· 𝐸 ( 𝜏 ( 𝑑 ) ) = 0 2 ξ€Έ are oscillatory. Moreover, for 𝑛 -odd assume that ξ€œ ∞ 𝑑 0 𝑒 𝑛 βˆ’ 2 π‘Ÿ βˆ’ 1 / 𝛾 ξ‚΅ ξ€œ ( 𝑒 ) ∞ 𝑒 ξ‚Ά π‘ž ( 𝑠 ) d 𝑠 1 / 𝛾 ξ€· 𝑃 d 𝑒 = ∞ . 0 ξ€Έ Then (i)for 𝑛 even, ( 𝐸 ) is oscillatory; (ii)for 𝑛 odd, every nonoscillatory solution π‘₯ ( 𝑑 ) of ( 𝐸 ) satisfies l i m 𝑑 β†’ ∞ π‘₯ ( 𝑑 ) = 0 .

Proof. Assume that π‘₯ ( 𝑑 ) is a nonoscillatory solution of ( 𝐸 ) ; let us say positive. Then ( π‘Ÿ ( 𝑑 ) [ π‘₯ ( 𝑛 βˆ’ 1 ) ( 𝑑 ) ] 𝛾 ) ξ…ž < 0 , and there exist a 𝑑 1 β‰₯ 𝑑 0 and an integer β„“ with 𝑛 + β„“ odd such that (2.1) holds.
If 0 < β„“ < 𝑛 βˆ’ 1 , then by Lemma 2.2 π‘Ÿ π‘₯ ( 𝑑 ) β‰₯ 1 / 𝛾 ( 𝑑 ) π‘₯ ( 𝑛 βˆ’ 1 ) ( 𝑑 ) ( ξ€œ 𝑛 βˆ’ 2 ) ! 𝑑 𝑑 1 π‘Ÿ βˆ’ 1 / 𝛾 ξ€· ( 𝑠 ) 𝑠 βˆ’ 𝑑 1 ξ€Έ 𝑛 βˆ’ 2 d 𝑠 . ( 3 . 1 ) Setting to ( 𝐸 ) , we get ξ€· ξ€Ί π‘₯ π‘Ÿ ( 𝑑 ) ( 𝑛 βˆ’ 1 ) ξ€» ( 𝑑 ) 𝛾 ξ€Έ ξ…ž + π‘ž ξ€Ί π‘₯ ( 𝑑 ) π‘Ÿ ( 𝜏 ( 𝑑 ) ) ( 𝑛 βˆ’ 1 ) ξ€» ( 𝜏 ( 𝑑 ) ) 𝛾 ( ( 𝑛 βˆ’ 2 ) ! ) 𝛾 Γ— ξ‚΅ ξ€œ 𝑑 𝜏 ( 𝑑 ) 1 π‘Ÿ βˆ’ 1 / 𝛾 ξ€· ( 𝑠 ) 𝜏 ( 𝑠 ) βˆ’ 𝑑 1 ξ€Έ 𝑛 βˆ’ 2 ξ‚Ά d 𝑠 𝛾 ≀ 0 . ( 3 . 2 ) Then 𝑦 ( 𝑑 ) = π‘Ÿ ( 𝑑 ) [ π‘₯ ( 𝑛 βˆ’ 1 ) ( 𝑑 ) ] 𝛾 is positive and satisfies the differential inequality: 𝑦 ξ…ž ( 𝑑 ) + π‘ž ( 𝑑 ) ( ( 𝑛 βˆ’ 2 ) ! ) 𝛾 ξ‚΅ ξ€œ 𝑑 𝜏 ( 𝑑 ) 1 π‘Ÿ βˆ’ 1 / 𝛾 ξ€· ( 𝑠 ) 𝑠 βˆ’ 𝑑 1 ξ€Έ 𝑛 βˆ’ 2 ξ‚Ά d 𝑠 𝛾 𝑦 ( 𝜏 ( 𝑑 ) ) ≀ 0 . ( 3 . 3 ) By Theorem 1 in [15], the corresponding equation ξ€· 𝐸 1 ξ€Έ has also a positive solution. A contradiction.
If β„“ = 𝑛 βˆ’ 1 , then by Lemma 2.2 π‘Ÿ π‘₯ ( 𝑑 ) β‰₯ 1 / 𝛾 ( 𝑑 ) π‘₯ ( 𝑛 βˆ’ 1 ) ( 𝑑 ) ( ξ€œ 𝑛 βˆ’ 2 ) ! 𝑑 𝑑 1 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑠 ) ( 𝑑 βˆ’ 𝑠 ) π‘˜ βˆ’ 2 d 𝑠 , ( 3 . 4 ) and proceeding as above, we find out that ξ€· 𝐸 2 ξ€Έ has a positive solution. A contradiction and the proof are finished for 𝑛 even.
Assume that β„“ = 0 ; note that it is possible only for 𝑛 is odd. Since π‘₯ β€² ( 𝑑 ) < 0 , then there exists a finite l i m 𝑑 β†’ ∞ π‘₯ ( 𝑑 ) = 𝑐 β‰₯ 0 . We claim that 𝑐 = 0 . If not, then π‘₯ ( 𝜏 ( 𝑑 ) ) β‰₯ 𝑐 > 0 , eventually, let us say, for 𝑑 β‰₯ 𝑑 2 . An integration of ( 𝐸 ) from 𝑑 to ∞ yields ξ€Ί π‘₯ π‘Ÿ ( 𝑑 ) ( 𝑛 βˆ’ 1 ) ξ€» ( 𝑑 ) 𝛾 β‰₯ ξ€œ ∞ 𝑑 π‘ž ( 𝑠 ) π‘₯ 𝛾 ( 𝜏 ( 𝑠 ) ) d 𝑠 ( 3 . 5 ) or equivalently π‘₯ ( 𝑛 βˆ’ 1 ) ( 𝑑 ) β‰₯ π‘Ÿ βˆ’ 1 / 𝛾 ξ‚΅ ξ€œ ( 𝑑 ) ∞ 𝑑 π‘ž ( 𝑠 ) π‘₯ 𝛾 ξ‚Ά ( 𝜏 ( 𝑠 ) ) d 𝑠 1 / 𝛾 . ( 3 . 6 ) Integrating 𝑛 βˆ’ 1 times from 𝑑 to ∞ , we get ξ€œ π‘₯ ( 𝑑 ) β‰₯ ∞ 𝑑 ( 𝑒 βˆ’ 𝑑 ) 𝑛 βˆ’ 2 ( π‘Ÿ 𝑛 βˆ’ 2 ) ! βˆ’ 1 / 𝛾 ξ‚΅ ξ€œ ( 𝑒 ) ∞ 𝑒 π‘ž ( 𝑠 ) π‘₯ 𝛾 ξ‚Ά ( 𝜏 ( 𝑠 ) ) d 𝑠 1 / 𝛾 d 𝑒 , ( 3 . 7 ) then π‘₯ ξ€· 𝑑 2 ξ€Έ β‰₯ 𝑐 ( ξ€œ 𝑛 βˆ’ 2 ) ! ∞ 𝑑 2 ξ€· 𝑒 βˆ’ 𝑑 2 ξ€Έ 𝑛 βˆ’ 2 π‘Ÿ βˆ’ 1 / 𝛾 ξ‚΅ ξ€œ ( 𝑒 ) ∞ 𝑒 ξ‚Ά π‘ž ( 𝑠 ) d 𝑠 1 / 𝛾 d 𝑒 , ( 3 . 8 ) which contradicts ξ€· 𝑃 0 ξ€Έ . The proof is complete.

Employing any result (e.g., Theorem 2.1.1 in [13]) for the oscillation of ξ€· 𝐸 1 ξ€Έ and ξ€· 𝐸 2 ξ€Έ , we immediately obtain criteria for studied properties of ( 𝐸 ) .

Corollary 3.2. Let l i m i n f 𝑑 β†’ ∞ ξ€œ 𝑑 𝜏 ( 𝑑 ) ξ‚΅ ξ€œ π‘ž ( 𝑒 ) 𝑑 𝜏 ( 𝑒 ) 1 π‘Ÿ βˆ’ 1 / 𝛾 ξ€· ( 𝑠 ) 𝑠 βˆ’ 𝑑 1 ξ€Έ 𝑛 βˆ’ 2 ξ‚Ά d 𝑠 𝛾 d 𝑒 > ( ( 𝑛 βˆ’ 2 ) ! ) 𝛾 e , l i m i n f 𝑑 β†’ ∞ ξ€œ 𝑑 𝜏 ( 𝑑 ) π‘ž ξ‚΅ ξ€œ ( 𝑒 ) 𝑑 𝜏 ( 𝑒 ) 1 π‘Ÿ βˆ’ 1 / 𝛾 ( 𝑠 ) ( 𝜏 ( 𝑠 ) βˆ’ 𝑑 ) 𝑛 βˆ’ 2 ξ‚Ά d 𝑠 𝛾 d 𝑒 > ( ( 𝑛 βˆ’ 2 ) ! ) 𝛾 e . ( 3 . 9 ) Moreover, for 𝑛 -odd assume that ξ€· 𝑃 0 ξ€Έ holds. Then (i)for 𝑛 even, ( 𝐸 ) is oscillatory; (ii)for 𝑛 odd, every nonoscillatory solution π‘₯ ( 𝑑 ) of ( 𝐸 ) satisfies l i m 𝑑 β†’ ∞ π‘₯ ( 𝑑 ) = 0 .

If we replace ξ€· 𝑃 0 ξ€Έ by stronger condition, we can establish oscillation of ( 𝐸 ) even if 𝑛 is odd.

Theorem 3.3. Let 𝜏 ξ…ž ( 𝑑 ) β‰₯ 0 . Assume that both first-order delay differential equations ξ€· 𝐸 1 ξ€Έ and ξ€· 𝐸 1 ξ€Έ are oscillatory. Moreover, for 𝑛 -odd assume that l i m s u p 𝑑 β†’ ∞ ξ€œ 𝑑 𝜏 ( 𝑑 ) ( 𝑒 βˆ’ 𝜏 ( 𝑑 ) ) 𝑛 βˆ’ 2 π‘Ÿ βˆ’ 1 / 𝛾 ξ‚΅ ξ€œ ( 𝑒 ) ∞ 𝑒 ξ‚Ά π‘ž ( 𝑠 ) d 𝑠 1 / 𝛾 ξ€· 𝑃 d 𝑒 > ( 𝑛 βˆ’ 2 ) ! . 1 ξ€Έ Then ( 𝐸 ) is oscillatory.

Proof. Assume that π‘₯ ( 𝑑 ) is a positive solution of ( 𝐸 ) . Then there exists an integer β„“ assigned with π‘₯ ( 𝑑 ) by Lemma 2.1. If 1 ≀ β„“ ≀ 𝑛 βˆ’ 1 , then proceeding as in the proof of Theorem 3.1 we eliminate π‘₯ ( 𝑑 ) . If β„“ = 0 , then it follows from (3.7) that ξ€œ π‘₯ ( 𝜏 ( 𝑑 ) ) β‰₯ ∞ 𝜏 ( t ) ( 𝑒 βˆ’ 𝜏 ( 𝑑 ) ) 𝑛 βˆ’ 2 ( π‘Ÿ 𝑛 βˆ’ 2 ) ! βˆ’ 1 / 𝛾 ξ‚΅ ξ€œ ( 𝑒 ) ∞ 𝑒 π‘ž ( 𝑠 ) π‘₯ 𝛾 ξ‚Ά ( 𝜏 ( 𝑠 ) ) d 𝑠 1 / 𝛾 ξ€œ d 𝑒 β‰₯ π‘₯ ( 𝜏 ( 𝑑 ) ) 𝑑 𝜏 ( 𝑑 ) ( 𝑒 βˆ’ 𝜏 ( 𝑑 ) ) 𝑛 βˆ’ 2 π‘Ÿ ( 𝑛 βˆ’ 2 ) ! βˆ’ 1 / 𝛾 ξ‚΅ ξ€œ ( 𝑒 ) 𝑑 𝑒 ξ‚Ά π‘ž ( 𝑠 ) d 𝑠 1 / 𝛾 d 𝑒 , ( 3 . 1 0 ) which contradicts ξ€· 𝑃 1 ξ€Έ . The proof is complete.

Corollary 3.4. Let (3.9) hold. Moreover, for 𝑛 -odd assume that ξ€· 𝑃 1 ξ€Έ holds. Then ( 𝐸 ) is oscillatory.

Example 3.5. We consider the forth-order delay differential equation: ξ‚€ 𝑑 ξ€· π‘₯ ξ…ž ξ…ž ξ€Έ ( 𝑑 ) 3  ξ…ž + π‘Ž 𝑑 6 π‘₯ 3 ξ€· 𝐸 ( πœ† 𝑑 ) = 0 , π‘Ž > 0 , 0 < πœ† < 1 , 𝑑 β‰₯ 1 . 3 ξ€Έ It is easy to verify that ξ€· 𝑃 0 ξ€Έ holds for ξ€· 𝐸 3 ξ€Έ ; moreover, conditions (3.9) reduce to π‘Ž πœ† 5 ξ‚€ 1 l n πœ†  > 1 e ξ‚€ 5 3  3 , ( 3 . 1 1 ) π‘Ž 2 7 πœ† 2  πœ† 6 ξ‚€ 1 1 2 5 l n πœ†  βˆ’ 3 πœ† 3 ( 1 βˆ’ πœ† ) + 3 ξ€· 5 0 1 βˆ’ πœ† 2 ξ€Έ βˆ’ 4 0 ( 1 βˆ’ πœ† ) 3 2 4 πœ† 3 ξƒ­ > 1 e , ( 3 . 1 2 ) respectively. Thus, by Corollary 3.4, if both (3.11) and (3.12) hold, then all nonoscillatory solutions of ξ€· 𝐸 3 ξ€Έ tend to zero. For π‘Ž = 𝛼 3 ( 𝛼 + 1 ) 3 ( 3 𝛼 + 5 ) πœ† 3 𝛼 , with 𝛼 > 0 , one such solution is π‘₯ ( 𝑑 ) = 𝑑 βˆ’ 𝛼 . On the other hand, condition ξ€· 𝑃 1 ξ€Έ takes the form π‘Ž ξ‚€ ξ‚€ 1 l n πœ†   + 1 βˆ’ πœ† 3 > 5 . ( 3 . 1 3 ) Therefore, by Corollary 3.4, ξ€· 𝐸 3 ξ€Έ is oscillatory, provided that all (3.11), (3.12), and (3.13) hold.

Acknowledgments

This work is the result of the project implementation: Development of the Center of Information and Communication Technologies for Knowledge Systems (ITMS project code: 26220120030) supported by the Research & Development Operational Program funded by the ERDF.