prime numbers and expressing non-prime numbers My textbook says if $b$ is a non-prime number then it can be expressed as a product of prime numbers. But if $1$ isn't prime how it can be expressed as a product of prime numbers?

This is mainly just an extended comment on Peter Foreman's answer. The (relatively difficult) uniqueness aspect of the Fundamental Theorem of Arithmetic is not needed for the OP's question, just the (easier) existence aspect.  
What's missing from the OP's textbook is the qualifier in the correct assertion that every non-prime number greater than $1$ can be expressed as a product of primes.  This is the existence aspect of FTA, and it can be proved by strong induction: If $n\gt1$ is not a prime, then $n=ab$ for some pair of integers with $1\lt a,b$. Both $a$ and $b$ must be less than $n$ (otherwise their product would be more than $n$), so we can assume, by strong induction, that each of them can be written as a product of primes, hence so can their product, which is $n$.
Remark: "Strong" induction means that you don't just assume an assertion is true for $n-1$ and then prove it for $n$, you assume it's true for all positive integers $k\lt n$.  In this case the assertion is "if $k\gt1$ and $k$ is non-prime, then $k$ can be written as a product of primes."  Note that the base case, $k=1$, is vacuously true, because $1$ is not greater than $1$.
