5
$\begingroup$

A question I asked:

A problem with 26 distinct positive integers

was characterised as a duplicate of:

Creating a sequence that does not have an increasing or a decreasing sequence of length 3 from a set with 5 elements

Can anybody explain to me why?

$\endgroup$
3
  • 2
    $\begingroup$ It appears that your question is the $n=5$ case of the result mentioned in Ross Millikan's answer. $\endgroup$
    – robjohn Mod
    Jan 25 '14 at 12:44
  • 4
    $\begingroup$ The first question is about a partially ordered set (natural numbers under divisibility) and the second about permutations of an ordered set. It is not at all obvious to me that they are equivalent. $\endgroup$ Jan 25 '14 at 14:49
  • 1
    $\begingroup$ I think some folks go dup hunting find something remotely similar in the title or the body... even if it is a bit of a stretch and flag it. But that's just my perception.. its probably in error. $\endgroup$
    – Chris
    Feb 1 '14 at 3:06
2
$\begingroup$

The question has since been re-opened by the votes of five community members.

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .