Welcome to BrainDen.com - Brain Teasers Forum
|Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account.
As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends.
Of course, you can also enjoy our collection of amazing optical illusions and cool math games.
If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top.
If you have a website, we would appreciate a little link to BrainDen.
Thanks and enjoy the Den :-)
Guest Message by DevFuse
1 reply to this topic
Posted 04 December 2013 - 02:20 AM
Consider a finite sequence of distinct integers. A subsequence is a sequence formed by deleting some items from the original sequence without disturbing their relative ordering. A subsequence is called monotone if it is either increasing (each term is larger than the one before it) or decreasing (each term is smaller than the one before it). For example, if the sequence is 4, 6, 3, 5, 7, 1, 2, 9, 8, 10, then 4, 6, 8, 10 is a monotone (increasing) subsequence of length 4 and 6, 5, 2 is a monotone (decreasing) subsequence of length 3.
a) Find a sequence of 9 distinct integers that has no monotone subsequence of length 4.
b) Show that every such sequence of length 10 has a monotone subsequence of length 4.
c) Generalize. How long must the sequence be to guarantee a monotone subsequence of length n?
Posted 05 December 2013 - 09:19 AM Best Answer
Spoiler for starters
The greatest challenge to any thinker is stating the problem in a way that will allow a solution.
- Bertrand Russell
- Bertrand Russell
0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users