Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2003 OIM Problems/Problem 4

Revision as of 03:32, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == Let <math>M = {1, 2, \cdots , 49}</math> be the set of the first <math>49</math> positive integers. Determine the maximum integer <math>k</math> such that the se...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $M = {1, 2, \cdots , 49}$ be the set of the first $49$ positive integers. Determine the maximum integer $k$ such that the set $M$ has a subset of $k$ elements in which there are no $6$ consecutive numbers. For that maximum value of $k$, find the number of subsets of $M$, of $k$ elements, that have the mentioned property.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2003_OIM_Problems/Problem_4&oldid=207234"