GATE Overflow - Recent questions tagged combinatory
http://gateoverflow.in/tag/combinatory
Powered by Question2AnswerDiscrete Mathematics and its applications - Kenneth Rosen, Counting - Basics of Counting - Exercise 51
http://gateoverflow.in/130886/discrete-mathematics-applications-counting-counting-exercise
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?Combinatoryhttp://gateoverflow.in/130886/discrete-mathematics-applications-counting-counting-exerciseFri, 26 May 2017 07:57:41 +0000maths
http://gateoverflow.in/129379/maths
In how many ways three girls and nine boys can be seated int two vans each having numbered seats ,3 in the front and and 4 at the back ?<br />
<br />
How many arrangements are possible if 3 girls sit together in back row on adjacent seats?Combinatoryhttp://gateoverflow.in/129379/mathsFri, 12 May 2017 10:58:33 +0000Placing rooks in nXn chess board
http://gateoverflow.in/128051/placing-rooks-in-nxn-chess-board
<p>Write a recursive backtracking solution for placing $3$ rooks in $6^*6$ chess board.</p>
<ol>
<li>Naive backtracking.</li>
<li>Try using bitmask to speed it up.</li>
</ol>
<p> </p>Algorithmshttp://gateoverflow.in/128051/placing-rooks-in-nxn-chess-boardThu, 04 May 2017 09:32:29 +0000Generalised permutation combinations
http://gateoverflow.in/126603/generalised-permutation-combinations
In how many ways can a dozen books be placed on four distinguishable shelves<br />
<br />
if no two books are the same, and the positions of the books on the shelves matter?<br />
<br />
(Hint: Break this into 12 tasks, placing each book separately. Start with the sequence 1,2,3,4 to<br />
<br />
represent the shelves. Represent the books by bi, i = 1, 2, ..., 12. Place b1 to the right of one of<br />
<br />
the terms in 1, 2, 3, 4. Then successively place b2, b3, ..., and b12.)Combinatoryhttp://gateoverflow.in/126603/generalised-permutation-combinationsSat, 22 Apr 2017 21:58:10 +0000Set theory
http://gateoverflow.in/123547/set-theory
Let S be a set of n elements and let p(S) be its power set. Then find total number of ordered pairs such that $s1 \cap s2 = \phi$ where s1 & s2 are subset of p(s)Algorithmshttp://gateoverflow.in/123547/set-theorySun, 02 Apr 2017 15:43:22 +0000permutations and combinations
http://gateoverflow.in/123042/permutations-and-combinations
<p><strong>A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways can 3 balls be drawn from the box, if at least one black ball is to be included in the draw?</strong></p>Verbal Abilityhttp://gateoverflow.in/123042/permutations-and-combinationsThu, 30 Mar 2017 23:38:40 +0000What is the highest power of 18 contained
http://gateoverflow.in/122544/what-is-the-highest-power-of-18-contained
What is the highest power of $18$ contained in $50C25$?Combinatoryhttp://gateoverflow.in/122544/what-is-the-highest-power-of-18-containedSat, 25 Mar 2017 18:49:55 +0000combinotrics
http://gateoverflow.in/121748/combinotrics
For a set of five true or false question ,no student has written all correct answers, and no two students have given the same given sequence of answers .What is the maximum number of students in the class for this to be possibleCombinatoryhttp://gateoverflow.in/121748/combinotricsThu, 16 Mar 2017 11:39:27 +0000lets A1,A2,A3 be three points on a straight line
http://gateoverflow.in/119737/lets-a1-a2-a3-be-three-points-on-a-straight-line
lets A1,A2,A3 be three points on a straight line. Lets B1,B2,B3,B4,B5 be five points on a straight line parallel to first one. Each of the three points on the first line is joined by a straight line to each of the five points on the second line. Further,no three or more of these joining lines met at a point except possibly at the A's or B's. Then the number of point of intersection of the joining lines lying between the two given straight lineCombinatoryhttp://gateoverflow.in/119737/lets-a1-a2-a3-be-three-points-on-a-straight-lineFri, 24 Feb 2017 17:50:34 +0000GATE2017-2-47
http://gateoverflow.in/118392/gate2017-2-47
If the ordinary generating function of a sequence $\big \{a_n\big \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .Combinatoryhttp://gateoverflow.in/118392/gate2017-2-47Tue, 14 Feb 2017 12:45:02 +0000gatebook
http://gateoverflow.in/116824/gatebook
How many ways are there for arranging letters of the word AMAZING such that the 'I' appears between the two 'A's?<br />
<br />
(A) 5! ways<br />
<br />
(B) 7! ways<br />
<br />
(C) 8! ways<br />
<br />
(D) 4! ways<br />
<br />
Note: AMZIA is valid and AIA is also valid right?Numerical Abilityhttp://gateoverflow.in/116824/gatebookTue, 07 Feb 2017 12:06:10 +0000Combinations
http://gateoverflow.in/115397/combinations
How many number of 5 letter words that use letters from the 3 letter set {a,b,c} in which each letter occur atleast once?Mathematical Logichttp://gateoverflow.in/115397/combinationsFri, 03 Feb 2017 20:55:39 +0000Stacks and Permutation
http://gateoverflow.in/115127/stacks-and-permutation
<p>A <strong>stack A </strong>has 4 entries as following sequence a,b,c,d and<strong> stack B</strong> is empty. An entry popped out of stack A can be printed or pushed to stack B. An entry popped out of stack B can only be printed.</p>
<p>Then the number of possible<em> <strong>permutation</strong>s</em> that the entries can be printed will be ?</p>
<p>Stack A Stack B = empty</p>
<table border="1" cellpadding="1" cellspacing="1" style="width:50px">
<tbody>
<tr>
<td>a(TOP)</td>
</tr>
<tr>
<td>b</td>
</tr>
<tr>
<td>c</td>
</tr>
<tr>
<td>d</td>
</tr>
</tbody>
</table>
<p> </p>DShttp://gateoverflow.in/115127/stacks-and-permutationFri, 03 Feb 2017 10:34:20 +0000P&C examples : finding no of ways
http://gateoverflow.in/114734/p%26c-examples-finding-no-of-ways
The number of ways can 10 balls be chosen from an urn containing 10 identical green balls , 5 identical yellow balls and 3 identical blue balls are_______ .Othershttp://gateoverflow.in/114734/p%26c-examples-finding-no-of-waysThu, 02 Feb 2017 10:54:13 +0000set theory
http://gateoverflow.in/114414/set-theory
Let S = {1, 2,......,10 }.<br />
<br />
The number of unordered pairs A, B where A and B are disjoint non-empty subsets of S is _________ (counting unordered pairs simply means we don&rsquo;t distinguish the pair A,B and B,A)Mathematical Logichttp://gateoverflow.in/114414/set-theoryWed, 01 Feb 2017 17:06:22 +0000Permutation and Combinations
http://gateoverflow.in/113040/permutation-and-combinations
<p><img alt="" height="86" src="http://gateoverflow.in/?qa=blob&qa_blobid=3917520023243175690" width="676"></p>
<p> </p>
<p>The number of ways to choose n things from 2n things of which n are alike and rest are unlike?</p>
<p> </p>Combinatoryhttp://gateoverflow.in/113040/permutation-and-combinationsSun, 29 Jan 2017 20:33:16 +0000functions-combinations
http://gateoverflow.in/109655/functions-combinations
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=7829148658363843966">
<br>
options
<br>
a) [ n!m(m-1)! ] / [2(n-m+1)]
<br>
b) [ n!m(m-1) ] / [2(n-m+1)]
<br>
c) [ m!n(n-1)! ] / [2(n-m+1)!]
<br>
d)( n-m)! / 2
<br>
<br>
put m=2 and n=5. we get almost injective functions=5
<br>
shudnt it be C?</p>Mathematical Logichttp://gateoverflow.in/109655/functions-combinationsMon, 23 Jan 2017 15:51:18 +0000Generating Function
http://gateoverflow.in/104105/generating-function
<p>Find the coefficient of <strong>x<sup>83</sup></strong> in<strong> (x<sup>5</sup>+ x<sup>8</sup>+ x<sup>11</sup>+ x<sup>14</sup>+ x<sup>17</sup>)<sup>10 </sup></strong>?</p>Combinatoryhttp://gateoverflow.in/104105/generating-functionWed, 11 Jan 2017 19:46:05 +0000Counting possible no of subsets from a set of numbers S
http://gateoverflow.in/102944/counting-possible-no-of-subsets-from-a-set-of-numbers-s
<ul>
<li>Using numbers from <strong>S</strong> = $\left \{ 1,2,3,4.......n \right \}$</li>
<li>We can use maximum up to <span class="marker">m</span> numbers to form a <span class="marker">set</span> using numbers from <strong>S. </strong>Repetition of numbers allowed.</li>
<li>How many ways we can form a set such that, $\sum x_i = K$. Where $K$ is another positive integer. Where $x_i$ are the elements belong $S$ that are included in the newly formed <span class="marker">set.</span></li>
</ul>
<p><strong>For example :</strong></p>
<ul>
<li>S = $\left \{ 1,2,3,4,5...11,12 \right \}$</li>
<li><span class="marker"> m</span> = $4$</li>
<li>if $K = 6$</li>
<li>Then possible few possible sets are $\{2,4\}, \;\; \{1,3,2\}, \;\; \{1,4,1\},\;\; \{1,1,1,3\}$ etc.</li>
<li>$\{1,1,1,1,2\}$ is not valid <span class="marker">set</span> for example.</li>
<li>Now how many such <span class="marker">sets</span> for a particular instance of the problem ? with </li>
<li>S = $\left \{ 1,2,3,4,5,6...12 \right \}$ , $m = 5$, $K = 8$ ?</li>
<li>If there is any generic idea ?</li>
<li>Ordered / Unordered both the cases !</li>
</ul>Combinatoryhttp://gateoverflow.in/102944/counting-possible-no-of-subsets-from-a-set-of-numbers-sMon, 09 Jan 2017 11:11:15 +0000Stars and bar problem
http://gateoverflow.in/100948/stars-and-bar-problem
<p>Can someone explain stars and bar problme using suitable example and images
<br>
<br>
Problem : <a rel="nofollow" href="https://en.wikipedia.org/wiki/Stars_and_bars_%28combinatorics%29#Proofs_via_the_method_of_stars_and_bars">https://en.wikipedia.org/wiki/Stars_and_bars_%28combinatorics%29#Proofs_via_the_method_of_stars_and_bars</a></p>
<p> </p>Combinatoryhttp://gateoverflow.in/100948/stars-and-bar-problemThu, 05 Jan 2017 13:04:19 +0000test series counting
http://gateoverflow.in/100202/test-series-counting
The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3,<br />
4, 5, 6} and X ∩ Y = Φ ________.Combinatoryhttp://gateoverflow.in/100202/test-series-countingWed, 04 Jan 2017 02:12:43 +0000Number of ways ... distinguishable into distinguishable.
http://gateoverflow.in/99437/number-of-ways-distinguishable-into-distinguishable
How many ways can n books be placed on k distinguishable shelves if no two books are same and the position of the books on the shelves matter.Mathematical Logichttp://gateoverflow.in/99437/number-of-ways-distinguishable-into-distinguishableMon, 02 Jan 2017 13:45:22 +0000Counting
http://gateoverflow.in/99333/counting
How many eight digit numbers are there, that contain a 5 and a 6____________? please explain!<br />
<br />
Ans: 8486912Combinatoryhttp://gateoverflow.in/99333/countingMon, 02 Jan 2017 10:31:11 +0000TheTrevTutor discrete maths 2 videos
http://gateoverflow.in/98563/thetrevtutor-discrete-maths-2-videos
<p>I want to know how good are the videos of discrete maths by TheTrevTutor. Has anyone been following the videos while preparing for GATE? </p>
<p> </p>
<p><a rel="nofollow" href="https://www.youtube.com/watch?v=DBugSTeX1zw&list=PLDDGPdw7e6Aj0amDsYInT_8p6xTSTGEi2">https://www.youtube.com/watch?v=DBugSTeX1zw&list=PLDDGPdw7e6Aj0amDsYInT_8p6xTSTGEi2</a></p>Combinatoryhttp://gateoverflow.in/98563/thetrevtutor-discrete-maths-2-videosSat, 31 Dec 2016 00:41:02 +0000combinations
http://gateoverflow.in/97711/combinations
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=11787487673859343352"></p>Mathematical Logichttp://gateoverflow.in/97711/combinationsWed, 28 Dec 2016 16:28:23 +0000TIFR2016-A-15
http://gateoverflow.in/97624/tifr2016-a-15
<p>In a tournament with 7 teams, each team plays one match with every other team. For each match, the team earns two points if it wins, one point if it ties, and no points if it loses. At the end of all matches, the teams are ordered in the descending order of their total points (the order among the teams with the same total are determined by a whimsical tournament referee). The first three teams in this ordering are then chosen to play in the next round. What is the minimum total number of points a team must earn in order to be guaranteed a place in the next round?</p>
<ol style="list-style-type:upper-alpha">
<li>13</li>
<li>12</li>
<li>11</li>
<li>10</li>
<li>9</li>
</ol>Combinatoryhttp://gateoverflow.in/97624/tifr2016-a-15Wed, 28 Dec 2016 12:33:13 +0000Kenneth Rosen (Special Indian Edition) Section 6.1 Exercise Problem #9d
http://gateoverflow.in/95581/kenneth-rosen-special-indian-edition-section-exercise-problem
Solve the recurrence relation $a_n = a_{n-1} + 2n + 3, a_0 = 4$Combinatoryhttp://gateoverflow.in/95581/kenneth-rosen-special-indian-edition-section-exercise-problemThu, 22 Dec 2016 22:52:54 +0000TIFR2017-A-6
http://gateoverflow.in/95033/tifr2017-a-6
<p>How many disctict words can be formed by permuting the letters of the word ABRACADABRA?</p>
<ol style="list-style-type:upper-alpha">
<li>$\frac{11!}{5! \: 2! \: 2!}$</li>
<li>$\frac{11!}{5! \: 4! }$</li>
<li>$11! \: 5! \: 2! \: 2!\:$</li>
<li>$11! \: 5! \: 4!$</li>
<li>$11! $</li>
</ol>Combinatoryhttp://gateoverflow.in/95033/tifr2017-a-6Wed, 21 Dec 2016 17:22:18 +0000TIFR2017-A-5
http://gateoverflow.in/94953/tifr2017-a-5
<p>How many distinct ways are there to split 50 identical coins among three people so that each person gets at least 5 coins?</p>
<ol style="list-style-type:upper-alpha">
<li>$3^{35}$</li>
<li>$3^{50}-2^{50}$</li>
<li>$\begin{pmatrix} 35 \\ 2 \end{pmatrix}$</li>
<li>$\begin{pmatrix} 50 \\ 15 \end{pmatrix}. 3^{35}$</li>
<li>$\begin{pmatrix} 37 \\ 2 \end{pmatrix}$</li>
</ol>Combinatoryhttp://gateoverflow.in/94953/tifr2017-a-5Wed, 21 Dec 2016 12:37:16 +0000Kenneth Rosen (Special Indian Edition) Section 5.1 Exercise Problem # 5
http://gateoverflow.in/94477/kenneth-rosen-special-indian-edition-section-exercise-problem
<p><strong>Question</strong>: Six different airlines fly from New York to Denver and seven fly from Denver to San Francisco. How many different pairs of airlines can you choose on which to book a trip from New York to San Francisco via Denver, when you pick an airline for the flight to Denver and an airline for the continuation flight to San Francisco ? How many of these pairs involve more than one airline ?</p>
<p> </p>Combinatoryhttp://gateoverflow.in/94477/kenneth-rosen-special-indian-edition-section-exercise-problemMon, 19 Dec 2016 19:53:26 +0000Counting
http://gateoverflow.in/94382/counting
How many ways you can put 3 identical balls into 2 box so that each box has at-most 2 balls?<br />
<br />
Is the answer 2?Combinatoryhttp://gateoverflow.in/94382/countingMon, 19 Dec 2016 13:48:25 +0000Counting
http://gateoverflow.in/94304/counting
How many ways, can sum be equal to 12 of 3 dice?<br />
<br />
Solution:<br />
x1+x2+x3=12 <br />
where 1<=x1<=6;1<=x2<=6; 1<=x3<=6<br />
How to solve it further?Combinatoryhttp://gateoverflow.in/94304/countingMon, 19 Dec 2016 11:28:36 +0000binomial theorem and expansions
http://gateoverflow.in/91878/binomial-theorem-and-expansions
<p>can anyone please explain these things:</p>
<p>formula for (1-x)<sup>n</sup></p>
<p>formula for 1/(1-x)<sup>n</sup></p>
<p>general term in expansion of (1-x)<sup>n </sup>and 1/(1-x)<sup>n</sup></p>
<p>and coeffecient of a term in these expansions.</p>
<p>please elaborate a little because i have read few questions on generating functions and binomial where these things are used but i am getting very confused.i dun know much about them and gathering info from internet is also confusing me.</p>Combinatoryhttp://gateoverflow.in/91878/binomial-theorem-and-expansionsMon, 12 Dec 2016 01:53:48 +0000Permutation and combination
http://gateoverflow.in/90501/permutation-and-combination
The number of ways can 10 balls be selected from urn contain 10 identical red balls 5 identical green balls and 3 identical blue balls ?Combinatoryhttp://gateoverflow.in/90501/permutation-and-combinationWed, 07 Dec 2016 20:07:41 +0000Discrete Maths
http://gateoverflow.in/89753/discrete-maths
Explain each one of the following:<br />
<br />
a ) In how many ways can we put 31 people in 3 rooms such that each room has an odd number of people ? <br />
<br />
b ) Coefficient of $x^4$ in the expansion $(1+ x + x^2 + x^3)^{11}$ using generating functions.<br />
<br />
c)Find out number of solutions $x_1+x_2+x_3 = 20 , 2<x_1<6 , 6<x_2<10 , 0<x_3<5$Mathematical Logichttp://gateoverflow.in/89753/discrete-mathsMon, 05 Dec 2016 22:04:04 +0000Permutation and combinations
http://gateoverflow.in/89167/permutation-and-combinations
Number of binary strings of length 10 with 3 consecutive 0's or 1's is ?Combinatoryhttp://gateoverflow.in/89167/permutation-and-combinationsSun, 04 Dec 2016 01:03:12 +00002 bulbs out of a sample of 10 bulbs manufactured by a company are defective.
http://gateoverflow.in/88215/bulbs-out-sample-bulbs-manufactured-company-are-defective
2 bulbs out of a sample of 10 bulbs manufactured by a company are defective. The probability that 3 out of 4 bulbs bought by a customer will not be defective isProbabilityhttp://gateoverflow.in/88215/bulbs-out-sample-bulbs-manufactured-company-are-defectiveWed, 30 Nov 2016 23:38:13 +0000GATE1989-4-i
http://gateoverflow.in/87874/gate1989-4-i
Provide short answers to the following questions:<br />
<br />
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.Combinatoryhttp://gateoverflow.in/87874/gate1989-4-iWed, 30 Nov 2016 00:22:00 +0000If any 6 points are chosen on the perimeter of a circle,
http://gateoverflow.in/87558/if-any-6-points-are-chosen-on-the-perimeter-of-a-circle
The largest integer n that satisfies the following condition:<br />
If any 6 points are chosen on the perimeter of a circle, then we can draw semicircle of the circle, such that there are at least n points on it. ____Combinatoryhttp://gateoverflow.in/87558/if-any-6-points-are-chosen-on-the-perimeter-of-a-circleTue, 29 Nov 2016 00:01:11 +0000Consider the graph G whose vertices are 4 element subsets of the set {1, 2, 3…10}
http://gateoverflow.in/87546/consider-the-graph-whose-vertices-are-element-subsets-the-set
Consider the graph G whose vertices are 4 element subsets of the set {1, 2, 3…10} with two vertices adjacent if and only if their intersection is empty. Then the number of edges does G have _______Graph Theoryhttp://gateoverflow.in/87546/consider-the-graph-whose-vertices-are-element-subsets-the-setMon, 28 Nov 2016 22:53:15 +0000Expected valu
http://gateoverflow.in/86239/expected-valu
<p><strong>I always do expected value questions wrong. Please suggest a detailed way to solve these questions. </strong></p>
<p>Suppose a coin is tossed 9 times, with the result</p>
<p>$HHHT T T T HT$</p>
<p>The first set of three heads is called a run.There are three more runs in this sequence, namely the next four tails, the next head, and the next tail. We do not consider the first two tosses to constitute a run, since the third toss has the same value as the first two.</p>
<p>Now suppose an experiment consists of tossing a fair coin three times. Find the expected number of runs</p>Combinatoryhttp://gateoverflow.in/86239/expected-valuSat, 26 Nov 2016 09:06:33 +0000Generalized permutation and combination
http://gateoverflow.in/85604/generalized-permutation-and-combination
How many positive integers less than 1,000,000 have the sum of their digits equal to 19? (using generating function)Combinatoryhttp://gateoverflow.in/85604/generalized-permutation-and-combinationThu, 24 Nov 2016 17:06:17 +0000GATE1990-3-ix
http://gateoverflow.in/84841/gate1990-3-ix
<p>Choose the correct alternatives (More than one may be correct).</p>
<p>The number of ways in which 5 A's, 5 B's and 5 C's can be arranged in a row is:</p>
<ol style="list-style-type:upper-alpha">
<li>$15!/(5!)^{3}$</li>
<li>$15!$</li>
<li>$\left(\frac{15}{5}\right)$</li>
<li>$15!(5!3!)$.</li>
</ol>Combinatoryhttp://gateoverflow.in/84841/gate1990-3-ixTue, 22 Nov 2016 19:25:36 +0000probability
http://gateoverflow.in/83453/probability
the letters of the word PROBABILITY are arranged in all possible ways . the chance that B's and also two I's occur together is .?Combinatoryhttp://gateoverflow.in/83453/probabilityThu, 17 Nov 2016 21:16:14 +0000how many ways can Harry select 24 of these candies so that he has at least six black one
http://gateoverflow.in/81166/many-ways-harry-select-these-candies-that-has-least-six-black
<p>If there is an unlimited number of red, green, blue and black jelly beans in how many ways can Harry select 24 of these candies so that he has at least six black one? _________.(</p>
<ol>
<li> <img alt="image:EM4/O11a.PNG" height="53" src="http://gatexcel.co.in/cache/EM4/O11a.PNG" width="172"></li>
<li> <img alt="image:EM4/O11b.PNG" height="57" src="http://gatexcel.co.in/cache/EM4/O11b.PNG" width="179"> </li>
<li> <img alt="image:EM4/O11d.PNG" height="49" src="http://gatexcel.co.in/cache/EM4/O11d.PNG" width="183"></li>
</ol>
<p> 4 <img alt="image:EM4/O11c.PNG" src="http://gatexcel.co.in/cache/EM4/O11c.PNG"></p>Combinatoryhttp://gateoverflow.in/81166/many-ways-harry-select-these-candies-that-has-least-six-blackFri, 11 Nov 2016 10:13:58 +0000Discrete Maths
http://gateoverflow.in/81145/discrete-maths
Messages are transmitted through a communication channel using two signals. The transmission of one signal requires $1 $ microsecond, the transmission of other signal requires $2$ microseconds. Assume that each signal in a message is immediately followed by the next signal. The number of different messages consisting of sequences of these two signals that can be sent in $10 \mu s$ is _________ ?<br />
<br />
Please explain ...?Combinatoryhttp://gateoverflow.in/81145/discrete-mathsFri, 11 Nov 2016 08:02:47 +0000GATE1987-1-II
http://gateoverflow.in/80032/gate1987-1-ii
<p>The total number of Boolean functions which can be realised with four variables is:</p>
<ol style="list-style-type:upper-alpha">
<li>$4$</li>
<li>$17$</li>
<li>$256$</li>
<li>$65, 536$</li>
</ol>Digital Logichttp://gateoverflow.in/80032/gate1987-1-iiMon, 07 Nov 2016 23:48:52 +0000There are 10 bacteria in a flask. Every hour 3 bacteria die and the remaining ones are each divided into 2 after 1 day
http://gateoverflow.in/79841/there-bacteria-flask-every-bacteria-remaining-divided-after
<p>There are 10 bacteria in a flask. Every hour 3 bacteria die and the remaining ones are each divided into 2 after 1 day, how many bacteria will live there?
<br>
Assume that the flask is large enough to contain any number of bacteria?</p>
<ol>
<li> 2<sup>26</sup></li>
<li> 2<sup>26</sup> + 6</li>
<li> 2<sup>24</sup> + 6</li>
<li> 2<sup>24</sup></li>
</ol>Combinatoryhttp://gateoverflow.in/79841/there-bacteria-flask-every-bacteria-remaining-divided-afterMon, 07 Nov 2016 16:12:36 +0000Combinatory
http://gateoverflow.in/79840/combinatory
In a country, there are coins of denominations ${$2}$, ${$3}$ and ${$7}$. How many different ways are there to pay exactly ${$10}$ ?Combinatoryhttp://gateoverflow.in/79840/combinatoryMon, 07 Nov 2016 15:42:40 +0000Permutation of coloring sides of a pentagon
http://gateoverflow.in/76864/permutation-of-coloring-sides-of-a-pentagon
Number of ways of painting a regular pentagon with 5 different colors is<br />
<br />
(A) 5!<br />
(B) 12<br />
(C) 1<br />
(D) 4!CO & Architecturehttp://gateoverflow.in/76864/permutation-of-coloring-sides-of-a-pentagonWed, 26 Oct 2016 11:05:05 +0000