Consider a sequence defined on the set of non-negative integers as follows: an = -2(-1)" for n 2 0. Which among the following is a recursive definition of this sequence? ao = -2, an = -an-1 for n > 0. o ao = -2, an = -2an-1 for n > 0. %3D ao = 2, an = -an-1 for n > 0. ao = 2, an = -2an-1 for n > 0.

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter8: Sequences, Series, And Probability
Section8.2: Sequences, Series And Summation Notation
Problem 42E
icon
Related questions
Topic Video
Question

Please Answer the following questions, Discrete mathematics 

Question 18
Consider a sequence defined on the set of non-negative integers as follows:
an = -2(-1)" for n > 0.
Which among the following is a recursive definition of this sequence?
ao = -2, an
= -an-1 for n > 0.
ao = -2, an = -2an-1 for n > 0.
%3|
ao
E 2, аn 3 —ап-1 for n > 0.
%3D
аo 3 2, аn 3 — 2ап-1 for n > 0.
Transcribed Image Text:Question 18 Consider a sequence defined on the set of non-negative integers as follows: an = -2(-1)" for n > 0. Which among the following is a recursive definition of this sequence? ao = -2, an = -an-1 for n > 0. ao = -2, an = -2an-1 for n > 0. %3| ao E 2, аn 3 —ап-1 for n > 0. %3D аo 3 2, аn 3 — 2ап-1 for n > 0.
Question 19
We want to put flowers into 5 vases, what is the minimum number of flowers do we need to guarantee that the vase with MOST flowers contains at least 4 flowers?
4*(5-1)+1=17
T5/41=1
5*(4-1)+1=16
5*4=20
Transcribed Image Text:Question 19 We want to put flowers into 5 vases, what is the minimum number of flowers do we need to guarantee that the vase with MOST flowers contains at least 4 flowers? 4*(5-1)+1=17 T5/41=1 5*(4-1)+1=16 5*4=20
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Propositional Calculus
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Algebra and Trigonometry (MindTap Course List)
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Intermediate Algebra
Intermediate Algebra
Algebra
ISBN:
9780998625720
Author:
Lynn Marecek
Publisher:
OpenStax College
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781938168383
Author:
Jay Abramson
Publisher:
OpenStax