I haven't taken abstract algebra yet, but I am curious about connections between number theory and abstract algebra. Do the proofs of things like Fermat's little theorem, the law of quadratic reciprocity, etc. rely upon techniques found in abstract algebra?
Thanks.
On
Historically, there are many results in number theory that were proved without modern algebra, but are now viewed algebraically.
For example, the Chinese Remainder Theorem (CRT) states that any system of congruences $$\begin{array}{rcl}x&\equiv& a_1 \pmod{b_1}\\x&\equiv& a_2 \pmod{b_2}\\ &\vdots& \\ x&\equiv& a_n \pmod{b_n}\end{array}$$ for which $b_1,b_2,\ldots ,b_n$ are pairwise coprime has a solution $x$, and that all such solutions are congruent $\mod {\prod_{i=1}^n b_i}$. The CRT was first proved by Sun Tzu$^\star$ around the year $300$.
It turns out that the Chinese remainder theorem is equivalent to the group theoretic statement that, whenever $b_1,b_2,\ldots ,b_n$ are pairwise coprime and $b=b_1b_2\cdots b_n$, $$\mathbb{Z}_{b}\cong \mathbb{Z}_{b_1}\times \mathbb{Z}_{b_2}\times \cdots \times \mathbb{Z}_{b_n}.$$ In the completely unbiased opinion of this finite group theorist, the above is a much more intuitive form of the CRT. In fact, seeing the theorem in this form inspired a generalization: if $I_1,I_2,\ldots, I_n$ are pairwise coprime$^{\star\star}$ ideals of a commutative ring $R$, and $I$ is the product of these ideals, then $$R/I\cong R/{I_1}\times R/{I_2}\times \cdots \times R/{I_n}.$$ With this generalization we can use the CRT in other commutative rings, like the Gaussian integers $\mathbb{Z}[i]$, polynomial rings $R[x]$, formal power series rings $R[[x]]$, and so on. All of these rings are objects of interest in algebraic number theory, a discipline which (obviously) emphasizes the blurry line between what is abstract algebra and what is number theory.
$\hspace{2pt}^\star\hspace{2pt}$ To my great disappointment, this was not the Art of War guy.
$^{\star\star}$ Here "pairwise coprime" means that $I_j+I_k=(1)$ for each $j\neq k$.
On
While you do not need abstract algebra to formulate many interesting number-theoretic problems, you will find it very useful in solving those problems. Many theorems in elementary number theory are very simple in their formulations, yet their known proofs require advanced algebraic machinery, for instance Fermats Last Theorem. Personally I find algebraic proofs of many elementary number theory statements much more natural than their "elementary" proofs, see for example Fermats Small Theorem or Chinese Remainder Thorem and their proofs. Once you get some training in basic group theory and basic ring theory those proofs are very natural.
Major results like the ones you cite have many proofs, including ones using abstract algebra, but also ones using combinatorics. See George Andrew's number theory book for an excellent example of the latter.