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

Algebra for College Students
10th Edition
ISBN:9781285195780
Author:Jerome E. Kaufmann, Karen L. Schwitters
Publisher:Jerome E. Kaufmann, Karen L. Schwitters
Chapter14: Sequences And Mathematical Induction
Section14.1: Arithmetic Sequences
Problem 79PS
icon
Related questions
Topic Video
Question
Discrete mathematics MCQ, please
answer the mcq, no need for detailed
explanation for the answers, since I
need the answers ASAP.
Consider a sequence defined on the set of non-negative integers as follows:
an = -2(-1)" for n2 0.
Which among the following is a recursive definition of this sequence?
ao = -2, an = -an-1 for n> 0.
o ao = 2, a, = -an-1 for n > 0.
ao = -2, a, = -2an-1 for n > 0.
%3D
ao = 2, a, = -2a,-1 for n> 0.
%3D
%3D
Assume we have 20 different covers that can be used for 3 virtually IDENTICAL mobiles. How many different sets of covers we can
use:
P(20, 3)
C(20, 3)
20+20+20
20 20 20
We want to compute the number of possible strings that contain 3 letters (each letter can be a CAPITAL letter or a small letter).
Each string should start with "A" or "a" and should finish with "Z
Assume we have 36 flowers to distribute between 5 vases. To compute the minimum number of flowers in a vase that contains the
maximum number of flowers, we use:
o 36/5=7.2
[ 36/5 =7
[36/5=8
36 5-180
Transcribed Image Text:Discrete mathematics MCQ, please answer the mcq, no need for detailed explanation for the answers, since I need the answers ASAP. Consider a sequence defined on the set of non-negative integers as follows: an = -2(-1)" for n2 0. Which among the following is a recursive definition of this sequence? ao = -2, an = -an-1 for n> 0. o ao = 2, a, = -an-1 for n > 0. ao = -2, a, = -2an-1 for n > 0. %3D ao = 2, a, = -2a,-1 for n> 0. %3D %3D Assume we have 20 different covers that can be used for 3 virtually IDENTICAL mobiles. How many different sets of covers we can use: P(20, 3) C(20, 3) 20+20+20 20 20 20 We want to compute the number of possible strings that contain 3 letters (each letter can be a CAPITAL letter or a small letter). Each string should start with "A" or "a" and should finish with "Z Assume we have 36 flowers to distribute between 5 vases. To compute the minimum number of flowers in a vase that contains the maximum number of flowers, we use: o 36/5=7.2 [ 36/5 =7 [36/5=8 36 5-180
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Sequence
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, algebra and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Algebra for College Students
Algebra for College Students
Algebra
ISBN:
9781285195780
Author:
Jerome E. Kaufmann, Karen L. Schwitters
Publisher:
Cengage Learning
Glencoe Algebra 1, Student Edition, 9780079039897…
Glencoe Algebra 1, Student Edition, 9780079039897…
Algebra
ISBN:
9780079039897
Author:
Carter
Publisher:
McGraw Hill
Big Ideas Math A Bridge To Success Algebra 1: Stu…
Big Ideas Math A Bridge To Success Algebra 1: Stu…
Algebra
ISBN:
9781680331141
Author:
HOUGHTON MIFFLIN HARCOURT
Publisher:
Houghton Mifflin Harcourt
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
College Algebra
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning