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}.

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section: Chapter Questions
Problem 6DE
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}.
%3D
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}. %3D
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 11 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Holt Mcdougal Larson Pre-algebra: Student Edition…
Holt Mcdougal Larson Pre-algebra: Student Edition…
Algebra
ISBN:
9780547587776
Author:
HOLT MCDOUGAL
Publisher:
HOLT MCDOUGAL