Register

#combinotirics

• edited by
441 views
0 0 votes
Find the largest integer value of x such that the following inequality holds:

(10 C x-1) <2*(10 C x)

In this question if solved line by line i am getting x<6.

but clearly if you put x=7, it satisfies the inequality and 7 becomes the largest integer.

Is there a procedure to get answer 7 step by step??

1 Answer

Best answer
3 3 votes

I am getting 7 as answer, check if you are making any calculation mistake.

• selected by
Voting & Accepting an answer helps improve the community
← Previous · CN TopologyNext → · CN Calculate Number ...
← Previous in category · Kenneth Rosen Editio...Next in category → · UPSC prelim test
Position:
Show:

Related questions

51 51 votes
6 answers 6 answers
13.5k
13.5k views
Misbah Ghaya asked Nov 29, 2016
13,502 views
GATE CSE 1989 | Question: 4-i
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
43 43 votes
6 answers 6 answers
16.9k
16.9k views
Kathleen asked Sep 23, 2014
16,869 views
GATE CSE 1999 | Question: 1.3
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
51 51 votes
8 answers 8 answers
17.3k
17.3k views
Kathleen asked Sep 14, 2014
17,299 views
GATE CSE 2000 | Question: 5
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetiti...
32 32 votes
2 answers 2 answers
10.5k
10.5k views
Misbah Ghaya asked Nov 19, 2016
10,532 views
GATE CSE 1990 | Question: 3-iii
The number of rooted binary trees with $n$ nodes is,Equal to the number of ways of multiplying $(n+1)$ matrices.Equal to the number of ways of arranging $n$ out of $2 n$ ...