
Algebra PreAlgebra and Basic Algebra Math Forum 
 LinkBack  Thread Tools  Display Modes 
February 14th, 2013, 05:29 AM  #1 
Member Joined: Feb 2012 Posts: 39 Thanks: 0  Counting problem
Determine the number of all ordered k  tuples (A1, A2, A3, ... , Ak) such that Ai, i=1,2,...k are not necessarily disjoint sets of S={1,2,3...n}, such that Ai=S. 

Tags 
counting, problem 
Search tags for this page 
Click on a term to search for related topics.

Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Counting problem  superconduct  Algebra  2  January 7th, 2014 10:01 AM 
Counting Problem  yo79  Math Events  6  February 26th, 2013 12:54 PM 
counting problem  scream  Applied Math  2  February 21st, 2012 11:50 AM 
Counting problem  kec11494  Applied Math  1  December 20th, 2010 08:44 PM 
Counting Problem  julian21  Applied Math  0  April 27th, 2010 09:48 AM 