How many four-digit even positive integers are there without a repetition of the digits?
My attempt:
First,we will classify such required arrangements into two groups:
$1$. Those that do contain $0$ as the end digit
To calculate this, we see that there are $9$ ways to fill the first place, $8$ ways to fill the second(we can't use $0$ and the digit at first place ), $7$ to fill the third place. Thus, there are $8\times 9\times 7$ to create required arrangements of form $1$.
$2$. Those that do not contain $0$ as the end digit.
Suppose we choose $i$ as the even number with $i\in {2,4,6,8}$. Then, we have $8$ options each for filling the first place and second place and $7$ options to fill the third. This gives us $8\times8\times 7$ ways for $2$. For each of the $4$ even end-digits, we get in total $4\times8\times8\times 7$ ways to do so.
Now if we add the final results of $1$ and $2$ we get $ 4\times8\times8\times 7+8\times 9\times 7=2296$ ways to obtain the given arrangements. But my book's answer is $4500$. What is wrong with my calculation? Please let me know.