View Poll Results: Insomnia?!
Voters: 96. You may not vote on this poll
Insomnia
#11
Re: Insomnia
Thermo isn't bad, but I'm just now starting my homework that's due in 6.5 hours.. not good. Mechanics wasn't terrible, I actually got most of the problems. Meh, Numerical ANALysis is ------- rape.
#13
Re: Insomnia
I think I prefer differential and integral calculus than discret math...
I'm not good with induction proof (well all kind of proof) and matrix ----...
Anyways I think it's my last math class... Even if I thought the prob. and stat. class was my last one
How can you tell that "Discrete Structure" is a math class?
I'm not good with induction proof (well all kind of proof) and matrix ----...
Anyways I think it's my last math class... Even if I thought the prob. and stat. class was my last one
How can you tell that "Discrete Structure" is a math class?
#15
Re: Insomnia
Originally Posted by Joseph Davis
How?
All engineering classes are math classes. Applied math classes.
All engineering classes are math classes. Applied math classes.
When I was in mechanic yes it's true math was everywhere, but not now in software...
By the way I don't consider doing primary operation (+, -, *, /) like math classes lol
Anyway, 2 years left so I don't really care...
#16
Re: Insomnia
Originally Posted by Teg2Boo
Hum... You are wrong. I'm in software engineering and yes I got like 7-8 math classes but it's only 35 credit on 120. The rest doesnt containt or almost no math.
When I was in mechanic yes it's true math was everywhere, but not now in software...
When I was in mechanic yes it's true math was everywhere, but not now in software...
#20
Re: Insomnia
Even if you understand it, make proof of theorems isnt easy.
I know what type of proof I need to prove this and I understand it:
Sum(j=1, n) [j^4] = n(n+1)(2n+1)(3n^2 + 3n -1) / 30 where n > 0 .
But I'm not good in induction proof...
Even if I know how turbo works, it doesnt mean I can design one.
I know what type of proof I need to prove this and I understand it:
Sum(j=1, n) [j^4] = n(n+1)(2n+1)(3n^2 + 3n -1) / 30 where n > 0 .
But I'm not good in induction proof...
Even if I know how turbo works, it doesnt mean I can design one.