<body><script type="text/javascript"> function setAttributeOnload(object, attribute, val) { if(window.addEventListener) { window.addEventListener('load', function(){ object[attribute] = val; }, false); } else { window.attachEvent('onload', function(){ object[attribute] = val; }); } } </script> <div id="navbar-iframe-container"></div> <script type="text/javascript" src="https://apis.google.com/js/plusone.js"></script> <script type="text/javascript"> gapi.load("gapi.iframes:gapi.iframes.style.bubble", function() { if (gapi.iframes && gapi.iframes.getContext) { gapi.iframes.getContext().openChild({ url: 'https://www.blogger.com/navbar.g?targetBlogID\x3d15925399\x26blogName\x3dPre-Cal+40S+(Winter+\x2706)\x26publishMode\x3dPUBLISH_MODE_BLOGSPOT\x26navbarType\x3dBLUE\x26layoutType\x3dCLASSIC\x26searchRoot\x3dhttp://pc4sw06.blogspot.com/search\x26blogLocale\x3den_US\x26v\x3d2\x26homepageUrl\x3dhttp://pc4sw06.blogspot.com/\x26vt\x3d8544817652058964798', where: document.getElementById("navbar-iframe-container"), id: "navbar-iframe" }); } }); </script>

Monday, April 24, 2006


The number of ways to arrange n objects that contain
k, k2, k3, .... sets of non-distinguishable
objects is given by:

Circular Permutations

The number of ordered arrangements that can be made from
n objects arranged in a circle is given by:
Ok people that was all for today (notes) but we talked about
this new assignment that we had to do and be done by the end
of may. This assignment can be found at this web site,
The assignment is a math problem that each one of us
had to solve (just one problem per person). This is
race, first person that gets to a problem and solves it
gets the mark for that question. And the second part
is to fix someone's problem if he/she gets it wrong.
Anyways that was all for the day and now its pay back
time, hahahaha anddddd the next scribbbe is calvinw.

Français/French Deutsch/German Italiano/Italian Português/Portuguese Español/Spanish 日本語/Japanese 한국어/Korean 中文(简体)/Chinese Simplified Nederlands/Dutch


Post a Comment

Links to this post:

Create a Link

<< Home