Does anyone have the solutions manual to Ken Rosen Discrete Mathematics...

This class is easy as shit tho.

lol u belev me wat a fgt

convolve with this

genuinely sorry, circumstances came up
here you go:

mega.nz/#!V7QHjAZY!RTG4mteav30l8NTXMQXK59dVKXP_WgHMaHXoeePd4xY

Virus detected

Here you go, and pass that class ;)

mega.nz/#!ZjJkmBKB!ml6793Rhkl4cJ25Goirb_zSEGDgtNwA1JMvgJF9O4s4

Is this real?

Nice dolphin porn

Not those anons, but to give you an idea... I did pure math graduated, sitting in a discrete math class for CS majors.

It's easy to fail the one I'm sitting in. Presumably this is a class for those that never seen proofs. What the prof does is lectures really quickly through the material. Solves trivial problems. Then on the exams the TAs make up problems that are actually very difficult given what the students learn/see in class. It's stuff I wouldn't expect a discrete math newb to be able to do in a beginner math class. Some of the questions are based on material you'd see in a grad class

Regardless, averages are very low. Like 50s low on exams.

Maybe discrete math is suppose to be like math 101 at most schools. I dunno cause when I took discrete math, mine was basically just a graph theory course and it already assumed knowledge in proofs.

>lying on the internet

man your life is sad

I took a discrete math course and felt ok until we had to do proof by induction. I still don't understand it. Help!

You prove it for 1. Then you prove it for 2. Then you prove it for 3... Then you prove it for k. Then you prove it for k+1.

The professor is testing your processing power and wants to see how many proofs you can write out in the alloted time. In fact, most professors keep a High Score board in their office (you'd know this if you went to office hours, brainlet).
>tfw proved 1+2+...n = n(n+1)/2 is true up to 47 in less than 50 minutes

Huh, that makes more sense. He just would set it up and then say "and the rest is just simple calculus....."

>never took calc
>office hours were in an unused classroom with no "high score board"

i passed this shit but i can't say i did well in the course overall. it can be pretty varied depending on what you're proving. "engineering induction" is just like, "do the first ~3 given base cases match the hypothesis? if so it's probably true for arbitrary n." with strong induction i start by rewriting the left and righthand sides in terms of n+1, often the righthand side being what you want in the end, then find a way to manipulate the given information to match the RHS. maybe you'll notice it's a geometric series, or has a simple algebraic solution, othertimes the solution might be more obtuse. just read a bunch of peoples proofs and it will make more sense maybe. apologies if this is not a great explanation

I got my exam on counting next week and I'm royally fucked. Any recommended tutorials to get an intuitive understanding on the topic?

Good fucking luck kiddo, if I had to suffer through discrete math without a solutions manual, so will you.

this... this is a joke, r-right?

Not the user you're replying to but. I also "failed" discrete math, was taking it with CS majors and just skipped it all and then I also skipped the examination because Veeky Forums made me hate engineers so much that when I was sitting in the corner in class and I heard those dumb fuck engineers laughing and giggling I just couldn't take it, I heard them give those wrong """"proofs"""" but really they were just giving out examples. And I couldn't take it, I screeched loud and clear and stormed out of the classroom ranting loudly on how low the average IQ of the room was at that given moment as a function of p and that the derivative of it was now negative.