Skip to main content

Binomial Coefficient: A Viewpoint

 

The formula to obtain Binomial Coefficient can be written as:

n! / r! × ( n - r )!

, which is equal to the number of combinations.

Here,

n  -> number of unique objects 

r  ->  number of objects that are                  

        considered ( r <= n  )

____________________

Suppose n = 4

Objects that are being considered:

( 1 ) A

( 2 ) B

( 3 ) C

( 4 ) D

_____________________

Let us restrict ourselves to deal with only three objects at a time. We will attempt to form combinations taking only three objects at a time.

So, here

r = 3

_____________________

From the ongoing discussion,

n = 4 and

r = 3

So, No. of combinations =

                4! / ( 3! × ( 4 - 3 )! ) = 4

Let us observe the four combinations that are formed:

___________________________

SlotI           Slot2          Slot3

___________________________

       A            B              C


       A             B              D


       B              C            D


        A              C           D

____________________________

The thought provoking  pattern of combinations tells  me to compare the objects- A, B, C, D- with tasks of Computer.  These tasks are arranged in three columns- Slot1, Slot2, and Slot3.

Tasks that occur in Slot1 have the highest rank. The Computer will firstly attend the tasks in Slot1. Tasks in Slot2 will get second priority. Slot3 tasks are to be attended at last.

_____________________________

Tasks    1st View 2nd View  3rd View

______________________________

     A         Slot I         Slot I          Slot I     


      B        Slot I         Slot II         Slot II

  

       C       Slot II        Slot II        Slot III


       D       Slot IIII      Slot III      Slot IIII   

_____________________________

Paying little attention, we can make out that the Task A always gets Slot I. Task B gets into Slot I only  for once. For the rest of the two occurences Task B is seen in Slot II. Task B and Task C appear in Slot II for  twice.  Task C is seen in  Slot III for only once. Task D always resides in Slot III.

_______________________

Observation: Combinations can serve to prioritize the participating elements. The resulting priorities can help in allocation of resources to elements in combinations. Prioritizing a list of elements forming combinations is also important as regards Computer Technology. That's it.

_______________________





Comments

Popular posts from this blog

Local-Area Networks

Local-Area Networks ( LANs ) are restricted to a small area. Such Networks may be established within a building. Computers that are part of Local-Area Networks are Personal Computers ( PCs ) or microcomputers. These Computers are connected to each other. Simple communication lines connect these Pers Networks bring people together. When people join  hands teamwork becomes possible. The structural composition of LANs simplifies teamwork. In other words, LAN hardware supports teams having similar processing requirements. LAN Computers readily support personalization of tasks allocated to professionals.  Office staff can work together and share information. This improves the efficiency of the entire workforce. It has been noted that here all the Networked Computers are Personal Computers. They are of equal capacity. Mostly LAN users have similar tasks. If situations allow, a user is independent to access any Computer to serve his purpose. LAN users can exercise the option of secu...

Computers - An Introduction

Computers are man made machines. They are made to work very fast. Working fast they can solve  big and small problems.  Modern science has given us these computers. They are very popular. Computers affect and change lives. They keep us happy.The happiness grows. Computers are quick and smart. Great problem solvers and simplifiers are our computers. They can do our work without stopping. Focus is on doing only what is needed. Not needed, not done.  Computers are  life-less servants. They cannot think or make decisions on their own. They are empowered to work. They are given each and every thing so that they carry out our orders. Orders are respected by computers. The manner in which computers work is wholly dependent on man.  The quality of service provided by computers is remarkable. They are loved by human beings. Computers are known for smart and quick service. Computers do not give wrong results. Correct answers are always given. Questions which are difficult...

Euclid's Algorithm

The Greatest Common Divisor ( GCD ) of  two numbers is a number. The number ( GCD ) causes division of the two numbers. This number ( GCD ) is the greatest number that is possible. This divisor partially forms the two numbers. Adding  the divisor successively may result in formation of the two numbers. One can note that when the divisor is the greatest, the division of the dividend is the sharpest. The division operation is very effective. When the Greatest Common Divisor of two numbers is considered, we think of a number that can cause division of both the numbers. Here the two numbers are unequal. The Greatest Common Divisor causes divisions of the two numbers differently. This is clear from the two different quotient values.  The GCD value is very interesting to note. It relates very well with the two numbers. The GCD of two even numbers is also an even number. The GCD of two odd numbers is an odd number. So, we can say that GCD is an abstraction of the two numbers in ...