<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/entrance/XSL/pmathml.xsl"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN"  "http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd">
<!--        This document was created  with

            S O F T 4 S C I E N C E      S c i W r i t e r   

            http://www.soft4science.com     e-mail: info@soft4science.com
-->
<html pref:renderer="mathplayer-dl" xmlns:pref="http://www.w3.org/2002/Math/preference" xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
    <meta name="Generator" content="soft4science SciWriter" />
    <meta name="PreferedMathMLRenderer" content="mathplayer_dl" />
    <meta name="template" content="" />
    <meta name="guid" content="d354d423-825c-4877-9c7d-46730d2e88fe" />
    <meta name="date_lastUpdated" content="2007-07-31T12:53:11" />
    <meta name="date_created" content="2007-07-31T12:22:45" />
    <title>unknown</title>
    <style type="text/css"><![CDATA[
    /* - CSS code generated by soft4science SciWriter  -*/

    body{font-size:14.25pt}
    table{font-size:14.25pt}
    a:link,a:active,a:visited{color:blue}
    img{border-width:0px}
    p,li,td,caption, blockquote{font-family:"Ariel",times}
    p{text-indent:1.5em}
    h1,h2,h3,h4,h5,h6{font-family:"Ariel",times;color:#000000}
    p{margin-top:0em;margin-bottom:0em}
    li{margin-top:0em;margin-bottom:0em}
    h1{font-size:160%;margin-top:1.5em;margin-bottom:1.5em}
    h2{font-size:150%;margin-top:1.5em;margin-bottom:1.5em}
    h3{font-size:140%;margin-top:1.5em;margin-bottom:1.5em}
    h4{font-size:130%;margin-top:1.5em;margin-bottom:1.5em}
    h5{font-size:120%;margin-top:1.5em;margin-bottom:1.5em}
    h6{font-size:110%;margin-top:1.5em;margin-bottom:1.5em}
    table{margin-top:1em;margin-bottom:1em}
    pre{margin-top:1em;margin-bottom:1em}
    hr{margin-top:1em;margin-bottom:1em}
    ul,ol{margin-top:0em;margin-bottom:0em}

    math          {font-family:"Ariel",times,CMSY10, CMEX10, Symbol}
    mml\:math    {font-family:"Ariel",times,CMSY10, CMEX10, Symbol}
    math[display="block"]{display:block;text-align:center;font-style: normal;}
    math *.[mathvariant="normal"] {font-weight: normal;font-style: normal;}
    math *.[mathvariant="bold"]   {font-weight: bold;font-style: normal;}
    math *.[mathvariant="italic"] {font-weight: normal;font-style: italic;}
    math *.[mathvariant="bold-italic"] {font-weight: bold;font-style: italic;}
    math *.[mathvariant="double-struck"]{font-family:msbm;font-weight: normal;font-style: normal;}
    math *.[mathvariant="script"]{font-family: eusb;font-weight: normal;font-style: normal;}
    math *.[mathvariant="bold-script"]{font-family: eusb;font-weight: bold;font-style: normal;}
    math *.[mathvariant="fraktur"] {font-family: eufm;font-weight: normal;font-style: normal;}
    math *.[mathvariant="bold-fraktur"] {font-family: eufm;font-weight: bold;font-style: italic;}
    math *.[mathvariant="sans-serif}"] {font-family: sans-serif,Arial,Lucida Sans Unicode, Verdana;font-weight: normal;font-style: normal;}
    math *.[mathvariant="bold-sans-serif"] {font-family: sans-serif,Arial, Lucida Sans Unicode, Verdana;font-weight: bold;font-style: normal;}
    math *.[mathvariant="sans-serif-italic"]{font-family: sans-serif,Arial, Lucida Sans Unicode, Verdana;font-weight: normal;font-style: italic;}
    math *.[mathvariant="sans-serif-bold-italic"] { font-family: sans-serif,Arial, Lucida Sans Unicode, Verdana ;font-weight: bold;font-style: italic;}
    math *.[mathvariant="monospace"] {font-family: monospace};
    math *.[mathsize="small"] {font-size: 80%};
    math *.[mathsize="big"] {font-size: 125%};
    msub>*:first-child[mathsize="big"],msup>*:first-child[mathsize="big"],msubsup>*:first-child[mathsize="big"],munder>*:first-child[mathsize="big"],mover>*:first-child[mathsize="big"],munderover>*:first-child[mathsize="big"],mmultiscripts>*:first-child[mathsize="big"],mroot>*:first-child[mathsize="big"] {font-size: 125%}
    msub>*:first-child[mathsize="small"],msup>*:first-child[mathsize="small"],msubsup>*:first-child[mathsize="small"],munder>*:first-child[mathsize="small"],mover>*:first-child[mathsize="small"],munderover>*:first-child[mathsize="small"],mmultiscripts>*:first-child[mathsize="small"],mroot>*:first-child[mathsize="small"] {  font-size: 80%}
    msub>*:first-child,msup>*:first-child,msubsup>*:first-child,munder>*:first-child,mover>*:first-child,munderover>*:first-child,mmultiscripts>*:first-child,mroot>*:first-child {  font-size: 100%}
    msub>*[mathsize="big"],msup>*[mathsize="big"],msubsup>*[mathsize="big"],munder>*[mathsize="big"],mover>*[mathsize="big"],munderover>*[mathsize="big"],mmultiscripts>*[mathsize="big"],math[display="inline"] mfrac>*[mathsize="big"],math *[scriptlevel="+1"][mathsize="big"] {  font-size: 89%  /* (.71 times 1.25) */}
    msub>* [mathsize="small"],msup>*[mathsize="small"],msubsup>*[mathsize="small"],munder>*[mathsize="small"],mover>*[mathsize="small"],munderover>*[mathsize="small"],mmultiscripts>*[mathsize="small"],math[display="inline"] mfrac>*[mathsize="small"],math *[scriptlevel="+1"][mathsize="small"] {  font-size: 57% /* (.71 times .80) */}
    msub>*,msup>*,msubsup>*,munder>*,mover>*,munderover>*,mmultiscripts>*,math[display="inline"] mfrac>*,math *[scriptlevel="+1"] {  font-size: 71%}
    mroot>*[mathsize="big"] {  font-size: 62%  /* (.50 times 1.25) */}
    mroot>*[mathsize="small"] {  font-size: 40% /* (.50 times .80) */}
    mroot>* {  font-size: 50%}
    .s4s-table-right{text-align:right}
    .s4s-table-right table{margin-left:auto;margin-right:0;text-align:left;}
    .s4s-table-right caption{margin-left:auto;margin-right:auto;text-align:center;}
    .s4s-table-center{text-align:center;}
    .s4s-table-center table{margin-left:auto;margin-right:auto;text-align:left;}
    .s4s-table-center caption{margin-left:auto;margin-right:auto;text-align:center;}
    .s4s-empty-paragraph{height:1em;width:textwidth}
    .s4s-noindent{text-indent:0em}
    .s4s-citation          {text-decoration:none}
    .s4s-footnote          {text-decoration:none;position:relative;top:-0.2em;font-size:0.9em}
    .s4s-section-reference {text-decoration:none}
    .s4s-theorem-reference {text-decoration:none}
    .s4s-table-reference   {text-decoration:none}
    .s4s-figure-reference  {text-decoration:none}
    .s4s-equation-reference{text-decoration:none}
    .s4s-latex             {visibility:hidden;line-height:0em;height:0em;width:0em;display:none}

    /* - CSS code generated by soft4science SciWriter  -*/
]]></style>
<link rel="stylesheet" href="/entrance/text.css" type="text/css" media="screen" /> 
  </head>
  <body style="margin-left:0px;margin-right:0px;margin-top:0px;margin-bottom:0px">
    <h1 align="center">
      Permutations And Combinations
    </h1>
    <p class="s4s-noindent">
      <span style="font-family:Arial;font-size:70%">1. The number of arrangements of 'n' things taken 'r' at a time</span>
    </p>
    <p>
      <span style="font-family:Arial;font-size:70%">
        <math xmlns="http://www.w3.org/1998/Math/MathML">
          <mmultiscripts>
            <mrow>
              <msub>
                <mrow>
                  <mi>P</mi>
                </mrow>
                <mrow>
                  <mi>r</mi>
                </mrow>
              </msub>
            </mrow>
            <mprescripts />
            <none />
            <mrow>
              <mi>n</mi>
            </mrow>
          </mmultiscripts>
        </math>= P (n, r) = n (n-1) (n - 2) ....... (n- r +1) = <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><mo>&excl;</mo></mrow><mrow><msup><mrow><mrow><mo>&lpar;</mo><mi>n</mi><mspace width="mediummathspace" height="0.2em" /><mo>&minus;</mo><mi>r</mi><mo>&rpar;</mo></mrow></mrow><mrow><mo>&excl;</mo></mrow></msup></mrow></mfrac></math> where r <math xmlns="http://www.w3.org/1998/Math/MathML"><mo>&le;</mo></math> n<br />2. <math xmlns="http://www.w3.org/1998/Math/MathML"><mmultiscripts><mrow><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mprescripts /><none /><mrow><mi>n</mi></mrow></mmultiscripts></math>= n!<br />3. Number of permutations with repetitions of n distinct objects taken r at a time = <math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mrow><mi>n</mi></mrow><mrow><mi>r</mi></mrow></msup></math><br />4. Number of circular permutations of n different things taken all at a time = (n-1) !<br />5. Out of n things if p are exactly alike of one kind, q exactly alike of the second kind, r exactly alike of the third kind and the remaining things all different, then the number of permutations of n things taken all at a time = <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><mo>&excl;</mo></mrow><mrow><mi>p</mi><mo>&excl;</mo><mspace width="mediummathspace" height="0.2em" /><mi>q</mi><mo>&excl;</mo><mspace width="mediummathspace" height="0.2em" /><mi>r</mi><mo>&excl;</mo></mrow></mfrac></math><br /><br />6. The number of selections of 'n' things taken 'r' at a time = n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi></mrow></msub></math>= <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mmultiscripts><mrow><msub><mrow><mi>P</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow><mprescripts /><none /><mrow><mi>n</mi></mrow></mmultiscripts></mrow><mrow><mi>r</mi><mo>&excl;</mo></mrow></mfrac></math>= <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><mo>&excl;</mo></mrow><mrow><mi>r</mi><mo>&excl;</mo><mspace width="mediummathspace" height="0.2em" /><msup><mrow><mrow><mo>&lpar;</mo><mi>n</mi><mo>&minus;</mo><mi>r</mi><mo>&rpar;</mo></mrow></mrow><mrow><mo>&excl;</mo></mrow></msup></mrow></mfrac></math>, r <math xmlns="http://www.w3.org/1998/Math/MathML"><mo>&le;</mo></math> n<br /><br />7. n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mn>0</mn></mrow></msub></math>= 1, n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mn>1</mn></mrow></msub></math>= n, n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mn>2</mn></mrow></msub></math>= <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><mo stretchy="false">&lpar;</mo><mi>n</mi><mo>&minus;</mo><mn>1</mn><mo stretchy="false">&rpar;</mo></mrow><mrow><mn>2</mn></mrow></mfrac></math>, n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mn>3</mn></mrow></msub></math>= <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><mo stretchy="false">&lpar;</mo><mi>n</mi><mo>&minus;</mo><mn>1</mn><mo stretchy="false">&rpar;</mo><mspace width="mediummathspace" height="0.2em" /><mo stretchy="false">&lpar;</mo><mi>n</mi><mo>&minus;</mo><mn>2</mn><mo stretchy="false">&rpar;</mo></mrow><mrow><mn>3</mn></mrow></mfrac></math>, .............., n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub></math>= 1<br /><br />8. n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi></mrow></msub></math>= n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi><mo>&minus;</mo><mi>r</mi></mrow></msub></math>.<br /><br />9. If n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi></mrow></msub></math> = n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>s</mi></mrow></msub></math> then either r= s or r+s = n <br />10. n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi></mrow></msub></math> + n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi><mo>&minus;</mo><mn>1</mn></mrow></msub></math>= (n+1)<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi></mrow></msub></math><br />11. Number of combinations of n dissimilar things taken r at a time when p particular things always occur = (n-p) <math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi><mo>&minus;</mo><mi>p</mi></mrow></msub></math><br /><br />12. Number of combinations of n dissimilar things taken r at a time when p particular exclude = (n-p)<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi></mrow></msub></math><br /><br />13. Number of diagonals of a ploygon of n sides= n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mn>2</mn></mrow></msub></math>- n = <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><mo stretchy="false">&lpar;</mo><mi>n</mi><mo>&minus;</mo><mn>3</mn><mo stretchy="false">&rpar;</mo></mrow><mrow><mn>2</mn></mrow></mfrac></math><br /><br />14. Number of ways in which m + n things can be divided into two groups containing m and n things = <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mo stretchy="false">&lpar;</mo><mi>m</mi><mo>&plus;</mo><mi>n</mi><mo stretchy="false">&rpar;</mo><mo>&excl;</mo></mrow><mrow><mi>m</mi><mo>&excl;</mo><mspace width="mediummathspace" height="0.2em" /><mi>n</mi><mo>&excl;</mo></mrow></mfrac></math>, where m = n. No. of ways of in which the 2m things can be divided into 2 groups having equal number of objects is <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mn>2</mn><mi>m</mi></mrow><mrow><mn>2</mn><mspace width="mediummathspace" height="0.2em" /><mo stretchy="false">&lpar;</mo><mi>m</mi><mo>&excl;</mo><mo stretchy="false">&rpar;</mo></mrow></mfrac></math><br /><br />15. When n is even, n<math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi></mrow></msub></math> is greatest when r= <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><mo>&minus;</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math> or <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><mspace width="mediummathspace" height="0.2em" /><mo>&plus;</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math><br /><br />16. <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow><mrow><mi>n</mi><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi><mo>&minus;</mo><mspace width="mediummathspace" height="0.2em" /><mn>1</mn></mrow></msub></mrow></mfrac></math>= <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><mo>&minus;</mo><mspace width="mediummathspace" height="0.2em" /><mi>r</mi><mspace width="mediummathspace" height="0.2em" /><mo>&plus;</mo><mn>1</mn></mrow><mrow><mi>r</mi></mrow></mfrac></math>; <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi><mo>&plus;</mo><mn>1</mn></mrow></msub></mrow><mrow><mi>n</mi><msub><mrow><mi>C</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></mfrac></math>= <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><mi>n</mi><mspace width="mediummathspace" height="0.2em" /><mo>&minus;</mo><mspace width="mediummathspace" height="0.2em" /><mi>r</mi></mrow><mrow><mi>r</mi><mspace width="mediummathspace" height="0.2em" /><mo>&plus;</mo><mspace width="mediummathspace" height="0.2em" /><mn>1</mn></mrow></mfrac></math><br /><br />17. If N= <math xmlns="http://www.w3.org/1998/Math/MathML"><msubsup><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow><mrow><mi>a</mi></mrow></msubsup></math>.<math xmlns="http://www.w3.org/1998/Math/MathML"><msubsup><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow><mrow><mi>b</mi></mrow></msubsup><mn>.</mn><msubsup><mrow><mi>P</mi></mrow><mrow><mn>3</mn></mrow><mrow><mi>c</mi></mrow></msubsup></math>......... where <math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub></math>, <math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub></math>, <math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mi>P</mi></mrow><mrow><mn>3</mn></mrow></msub></math> ...... are distinct primes and a, b, c, ...... are +ve integers then, the number of divisors of N= (a+1) (b+1) (c+1) ...... (Including 1 and N).</span>
    </p>
    <p>
      <span style="font-family:Arial;font-size:70%">The sum of the devisors is <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><msubsup><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow><mrow><mi>a</mi><mo>&plus;</mo><mn>1</mn></mrow></msubsup><mo>&minus;</mo><mn>1</mn></mrow><mrow><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>&minus;</mo><mspace width="mediummathspace" height="0.2em" /><mn>1</mn></mrow></mfrac></math>. <math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><msubsup><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow><mrow><mi>b</mi><mo>&plus;</mo><mn>1</mn></mrow></msubsup><mo>&minus;</mo><mn>1</mn></mrow><mrow><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>&minus;</mo><mspace width="mediummathspace" height="0.2em" /><mn>1</mn></mrow></mfrac></math>.<math xmlns="http://www.w3.org/1998/Math/MathML"><mfrac><mrow><msubsup><mrow><mi>P</mi></mrow><mrow><mn>3</mn></mrow><mrow><mi>c</mi><mo>&plus;</mo><mn>1</mn></mrow></msubsup><mo>&minus;</mo><mn>1</mn></mrow><mrow><msub><mrow><mi>P</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>&minus;</mo><mspace width="mediummathspace" height="0.2em" /><mn>1</mn></mrow></mfrac></math>.......</span>
    </p>
    <p>
      <span style="font-family:Arial;font-size:70%"> </span>
    </p>
  </body>
</html>
