Abstract: In this paper, by constructing explicitly a class of irreducible trinomials of high degree over F₂, we give an affirmative answer to the following question; "Do there exist irreducible polynomials whose degree are greater than or equal to any given integer?" By using a number theoretic function we also propose three classes of reducible trinomials of high degree over F₂.