×

### Let's log you in.

or

Don't have a StudySoup account? Create one here!

×

or

by: Dino Corwin

17

0

4

# Honors Discrete Mathematics MAD 2104

Dino Corwin
FAU
GPA 3.8

Jorge Viola-Prioli

These notes were just uploaded, and will be ready to view shortly.

Either way, we'll remind you when they're ready :)

Get a free preview of these Notes, just enter your email below.

×
Unlock Preview

COURSE
PROF.
Jorge Viola-Prioli
TYPE
Class Notes
PAGES
4
WORDS
KARMA
25 ?

## Popular in Mathematics Discrete

This 4 page Class Notes was uploaded by Dino Corwin on Monday October 12, 2015. The Class Notes belongs to MAD 2104 at Florida Atlantic University taught by Jorge Viola-Prioli in Fall. Since its upload, it has received 17 views. For similar materials see /class/221637/mad-2104-florida-atlantic-university in Mathematics Discrete at Florida Atlantic University.

×

## Reviews for Honors Discrete Mathematics

×

×

### What is Karma?

#### You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 10/12/15
16BINOMIAL COEFFICIENTS In section 9 we showed that there are 2n subsets of any set with n elements As a consequence we computed the number of subsets with at most 18 elements of a set with 20 elements You are invited to review the solution we presented then before proceeding There was a reason not to try to solve the similar problem with at most 17 elements we need a formula to calculate how many sets with exactly 17 elements are there in a 20element set 50 we address now the general problem if A has n elements how many subsets ofA with exactly k elements are there Of course here k s n n The symbol k will denote the number of kelement subsets ofan nelement set for O s k s n J Viola Prioli n is called a binomial coefficient for reasons to be seen later and is also called quotn choose kquot for obvious reasons Calculators and some textbooks n have an alternative symbol for J that IS nCk Please be adVIsed that we k will use them indistinctly throughout Before proceeding let us underscore the difference between lists of length two with or without repetitions and 2element sets out of a b c There are 23 subsets 8 subsets There are 9 lists of length 2 There are 6 lists of length 2 if repetitions are not allowed There are 3 2element sets a b a c and b c J Viola Prioli Let us return to the de nition ofthe combinatorials It follows from it that n a each k isa natural number A formula to compute is next n n THEOREM k k n k Proof t suf ces to prove that x k x n k n J Viola Prioli

×

×

### BOOM! Enjoy Your Free Notes!

×

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

## Why people love StudySoup

Steve Martinelli UC Los Angeles

#### "There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Allison Fischer University of Alabama

#### "I signed up to be an Elite Notetaker with 2 of my sorority sisters this semester. We just posted our notes weekly and were each making over \$600 per month. I LOVE StudySoup!"

Jim McGreen Ohio University

Forbes

#### "Their 'Elite Notetakers' are making over \$1,200/month in sales by creating high quality content that helps their classmates in a time of need."

Become an Elite Notetaker and start selling your notes online!
×

### Refund Policy

#### STUDYSOUP CANCELLATION POLICY

All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email support@studysoup.com

#### STUDYSOUP REFUND POLICY

StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here: support@studysoup.com

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to support@studysoup.com