Checkout
checkout
view
Your Cart Your Cart: item(s)
View Details $1.99 Download Add to Cart

Recurrence Relation

A vending machine accepts only pennies and nickels. a) Find a recurrence relation for the number of ways to deposit n cents where the order in which coins are deposited matters. b) What are the initial conditions for the recurrence? c) Use the recurrence to count the number of ways to deposit 12 cents.

Subject:

Math

Topic:

Discrete Structures

Posting ID:

110996

OTA ID:

101298

View Details $1.99 Download Add to Cart

Recurrence Relations

Solve the recurrence relation a(n)=3a(n-1)+10a(n-2) with the initial conditions a(0)=0 and a(1)=2. Solve the recurrence relation a(n)=3a(n-1)+10a(n-2) +12 with the initial conditions a(0)=0 and a(1)=2. For a particular solution, try a(n)=C, a constant.

Subject:

Math

Topic:

Discrete Structures

Posting ID:

110997

OTA ID:

105303

View Details $1.99 Download Add to Cart

Equivalence Relations

H is the relation on the set of all people given by H = {(a,b)|a and b are the same height}. Is H an equivalence relation? Explain your answer.

Subject:

Math

Topic:

Discrete Structures

Posting ID:

110998

OTA ID:

105597

View Details $1.99 Download Add to Cart

Combinations

A committee of size seven is to be selected from a group of ten people. In how many ways can this be done?

Subject:

Math

Topic:

Discrete Structures

Posting ID:

111026

OTA ID:

105167

View Details $1.99 Download Add to Cart

Relations : Reflexive, Symmetric and/or Transitive

Determine if the relation R on the set of all people is reflexive, symmetric and/or transitive where (x,y) "E" R if and only if x and y live within one mile of each other. NOTE: I cannot correctly indicate the symbol to show "is a member of" so I have used "E" in it's place.

Subject:

Math

Topic:

Discrete Structures

Posting ID:

111027

OTA ID:

103300

Page generated in 0.1872 seconds

About Us ·  Contact Us ·  Samples ·  Solutions ·  Legal Terms and Conditions ·  Privacy Policy ·  Copyright Notification Policy

©2010 SolutionLibrary.com

Search for Solutions About Us Samples