Posted by **ABCD** on Wednesday, May 29, 2013 at 4:30am.

Mariolys is creating a numbered list of distinct integers. Luigis sees that there are N numbers in the list, and states that he can find either a subsequence of length 13 with increasing terms or a subsequence of length 17 with decreasing terms. What is the minimum value of N for Luigis' claim to be true?

Details and assumptions:

Luigis doesn't know the numbers on Mariolys list.

The chosen terms of the subsequence need not be consecutive. In the list {1,45,23,56,25,58,8,2}, we have an increasing subsequence of length 4 formed by 1,23,25,58 (which are the 1st, 3rd, 5th and 7th terms of the original list). We also have a decreasing subsequence of length 4 formed by 56,25,8,2 (which are the 4th, 5th, 7th and 9th terms of the original list).

## Answer This Question

## Related Questions

- Computer - How do you solve this algorithm problem? Suppose that you are given a...
- computer science - Hey I have three questions with creating these methods, ...
- JAVA PROGRAM SELECTION SORT USING RECURSION - JAVA PROGRAM Details: I'm having a...
- computer science - Hey I have three questions with creating these methods can ...
- Integers - Suppose a1, a2, . . . , an is a list of n numbers with the following ...
- maths-somebody!anyone help - An arbitary list of integers both positive and ...
- Advanced Math - Planting Depth(in)|Height (in) 3 |5 6 |9 6 |18 6 |8 7 |21 6 |12 ...
- Computer Science JAVA FUNCTIONS - Write a Function You will be given one of the ...
- Computer science - Write a function in Python: Given a list of words, indicate ...
- help please - An arbitary list of integers both positive and negative is ...

More Related Questions