Number Theory Advice: Struggling with Proofs in Course

only_huce
Messages
62
Reaction score
0
I am an undergrad taking my first course in number theory. For some reason, this is the hardest course I have ever taken in my life. It puts Calculus and Differential Equations to shame in my honest opinion.

My question is, am I the only one who thinks so? I mean, I go over the chapters, attend every class, and I can do any problem or apply any theorem when it involves actual numbers. However, when I have to do proofs (which is 70% of the coursework) I still find myself struggling. It's half-way through the semester and constructing proofs still hasn't clicked for me. When doing the HW, I find myself spending over 2 hours on a problem only to prove it half way.

Am I doing something wrong? Any advice is greatly appreciated.
 
Physics news on Phys.org
Did you have to do proofs in your other courses?
 
No, I'm an engineering major deciding to pursue a math minor therefore this is the first class I've ever taken involving proofs.

I mean I did some proofs in calculas 2, however they were more computational and involved integrating a formula rather than logical which is what I am encountering in this course.
 
Definitions, definitions, definitions.

In mathematics, definitions are "working" definitions. You use the exact wording of definitions in proofs. The absolute best thing you can do is learn definitions by heart and understand what they mean.
 
I'd beg to differ on that matter of semantics; definitions in mathematics are absolute definitions for the given theory. To grasp a proof what's required is not committing them to memory, but following from the foundations they establish.

Considering the definitions you're working with in different ways and combining them is what leads to proofs of propositions most easily.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top