How many ways are there to form a subset of [n] of size k with the property that each selected number is at distance at least 3 from every other selected number? For example, if n = 8 and k = 3 there are 4 ways: {1,4,7}, {1,4, 8}, {1,5,8}, and {2,5,8}.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter1: Fundamentals
Section1.5: Permutations And Inverses
Problem 3E
icon
Related questions
Question
How many ways are there to form a subset of [n] of size k with the property that each selected
number is at distance at least 3 from every other selected number? For example, if n = 8 and
k = 3 there are 4 ways: {1,4, 7}, {1, 4, 8}, {1,5,8}, and {2,5, 8}.
Transcribed Image Text:How many ways are there to form a subset of [n] of size k with the property that each selected number is at distance at least 3 from every other selected number? For example, if n = 8 and k = 3 there are 4 ways: {1,4, 7}, {1, 4, 8}, {1,5,8}, and {2,5, 8}.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage