Explore BrainMass

Recurrence Relation

A recurrence relation is an equation that recursively defines a sequence, once one more initial terms are given. Each further term of the sequence is defined as a function of the preceding terms. The term difference equation is sometimes referred to as a specific type of recurrence relation. However, difference equation is frequently used to refer to any recurrence relation.

An example of a recurrence relation is the logistic map:

Xn+1 = rxn(1-xn)

With a given constant r, given the initial term x0 each subsequent term is determined by this relation. Some simply defined recurrence relations can have very complex behaviours and they are a part of the field of mathematics known as nonlinear analysis. Solving the recurrence relation means obtaining a closed-form solution: a non-linear recursive function of n.

Recurrence relation has many different applications. These can include biological applications, digital signal processing and economics. In biology, some of the best-known difference equations have their origins in the attempt to model population dynamics. The logistical map is used either directly to model population growth, or as a starting point for more detailed models. In digital signal processing, recurrence relations can model feedback in a system, where outputs at one time become inputs for future time. They thus arise in infinite impulse response digital filters. Recurrence relations, especially linear recurrence relations, are used extensively in both theoretical and empirical economics. 

Relations and Graph Theory

1. List all the functions from the three element set {1, 2, 3} to the set {a, b}. Which functions, if any, are one-to-one? Which functions, if any, are onto? 2. How many base 10 numbers have 3 digits? How many three-digits numbers have no two consecutive digits equal? How many have at least one pair of consecutive digits equal?

Predicate logic

PREDICATE LOGIC Note: For your convenience the truth tables are included. You may not need to use all of the columns in the skeleton tables. 1. Use modus ponens or modus tollens to fill in the blanks in the arguments so as to produce a valid inference. If this polygon is a triangle, then the sum of its interior an

Truth Tables Equivalent Statements

LOGIC 1. Indicate and justify which of the following sentences are statements. a) She is mathematics major. b) 128 = 26 c) x = 26 2. Write the statement bellow in symbolic form using the symbols ~, , and  and the indicated letters to represent component statements. (m = "Juan is a math major", c = "J

Combinations and Permutations

COUNTING PERMUTATION COMBINATIONS 1. In a monthly test, the teacher decides that there will be three questions, one from each chapter I, II and III of the book. If there are 12 questions in chapter I, 10 in chapter II and 6 in chapter III. In how many ways can three questions be selected? Justify your answer. 2. Find the tot

One-To-One Functions

FUNCTIONS 1. Find all functions from X = {a, b, c} to Y = {u, v}. 2. Let F and G be functions from the set of all real numbers to itself. Define new functions F - G: R R and G - F: R R as follows: (F - G)(x) = F(x) - G(x) for all x  R, (G - F)(x) = G(x) - F(x) for all x  R. Does F - G = G - F? Explain. 3. Le

Set Relations Binary Relations

Relations 1. Let C = {2, 3, 4, 5} and D = {3, 4} and define a binary relation S from C to D as follows: for all (x, y)  C  D, (x, y)  S  x  y. a) Write S as a set of ordered pairs. b) Is 2 S 4? Is 4 S 3? Is (4, 4)  S? Is (3, 2)  S? 2. Let A = {3, 4, 5} and B = {4, 5, 6} and let S be the "divides" rel

Set Theory questions

1. Let T = {m   m = 1 + (-1)i, for some integer i}. Describe T. 2. Let A = {m   m = 2i - 1, for some integer i}, B = {n   n = 3j + 2, for some integer j}, C = {p   p = 2r + 1, for some integer r}, and D = {q   q = 3s - 1, for some integer s}. a) Describe the 4 sets (by enumerat

Rate of Return Probability Question

Assessing return and risk Tento Manufacturing must choose between two asset purchases. The annual rate of return and the related probabilities are given in the following table. Summarize the firm's analysis to this point. Project 257 Project 432 Rate of return Probabilit

Capital Asset Pricing Model; Risk Return Analysis

Tony is wondering how much risk he must accept in order to generate a reasonable return on his portfolio. The risk-free return currently is 5 percent. The return on the market portfolio is 16 percent. Use the Capital Asset Pricing Model to calculate the beta coefficient associated with each of the following portfolio returns.

Recursion and Iteration

Can someone please help with my practice questions? I would like details and explanations using words to show how you got the answer. The questions cover the concepts of linear recurrence, iterations, and power functions.

Discrete Math-Induction

A flagpole is n feet tall. On this flag pole we display flags of the following types: red flags that are 1 foot tall, blue flags that are 2 feet tall and green flags that are 2 feet tall. The sum of the heights is exactly n feet. Prove that there are exactly [(2/3)*(2^n)] + [(1/3)*(-1)^n] ways to display the flags.

The Newton-Raphson Method

The Newton-Raphson Method 1. Consider the function . i) Show, graphically or otherwise, that the equation has a root in the interval (1,2). Show that . ii) Use the secant method, with the function f(x) and starting values, 1 and 2, to find an estimate of correct to three decimal places. 2. Verify that has j

Recurrence relations - initial conditions

A) Find a recurrence relation for the number of bit strings of length n that contain three consecutive 0s. b) What are the initial conditions? c) How many bit strings of length seven contain three consecutive 0s?

Recurrence relations, compound interest, polynomials, number of combinations

Please help with the following discrete math involving recurrence relations, compound interest, polynomials, number of combinations and iteration. 14. Individual membership fees at the evergreen tennis club were $50 in 1970 and have increased by $2 per year since then. Write a recurrence relation and initial conditions for

Matrix Relation

5. Let A = { 1, 2, 3, 4 } , and let R be the relation defined on A defined by: R = {(1,1), (2,2), (3,3), (4,4), (1,2), (2,3), (3,4), (1,3), (2,4)} A. Draw the digraph of this relation. B. Which of the properties: reflexive, antisymmetric and transitive are true for the given relation? Begin your discussion by defini

Recurrence relations

See attached The functions Tn(x), for n=0, 1, 2...satisfy the recurrence relation....

Recurrence Relations : Stirling Numbers

A Stirling number Snk is definedc as the number of ways of partitioning the set of positive numbers (1,2,3,....n) into k non empty subsets. We can show that by considering if the singleton subset (n) is a partition or not that Snk = Sn-1, k-1 + kSn-1,k Another recurrence relation comes from considering the number of partit

Recurrence Relations : Stirling Numbers

A stirling number Snk is defined as the number of ways to partition the set of positive numbers (1,2,3....n) into k non empty subsets. By considering whether or not the singleton subset (n) is included in a partition or not show: Snk = Sn-1,k-1 - kSn-1,k

Probability: Moment-Generating Functions

The moment-generating function Please solve for only #3.1. I am attaching 2-5_14.doc, please take a look when you work on #3.1. I think there are two questions in the problem. Please explain each step of your solutions for each part. 3.1 How to stress out Coach A college hires a new football coach on the terms that if the

Stability of a 2D recursive relation near a fixed point

Observe that (0,0) is a fixed point of the system: x_(n+1) = u*x_n - y_n + (y_n)^2 y_(n+1) = x_n + (x_n)^4 + y_n Regardless of the choice of parameter u. Determine the range of u values for which this fixed point is stable.

Combinations, Directed Graphs and Recurrence Relations

1. A baseball manager has decided who his 5 starting hitters are to be, but not the order in which they will bat. How many possibilities are there? 2. Susan has a fondness for chocolate desserts, in particular, pudding, pie, ice cream, éclairs, and cookies. Her preference is for ice cream over pie and cookies, éclairs over

Sets, Relations, Prim's Algorithm, State Tables and Recurrence Relations

1. Let A = {1, 2, 3, 4}, B = {3, 4, 5}, C = {1}, and D = {x: 3 < x < 10}. Are each of the following true or false? b. B &#8838; D c. &#8709; &#8838; D 2. Calculate the following: a. P(8, 4) 3. Let A = {1, 2, 3, 4}, B = {1, 4, 5}, C = {3, 5, 6}, and the universal set U = {1, 2, 3, 4, 5, 6}. a. Determi

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.

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.