 My Math Forum Calculate all possible moves of m distinct balls into a N points space
 User Name Remember Me? Password

 Calculus Calculus Math Forum

 January 17th, 2017, 10:46 PM #1 Newbie   Joined: Jan 2017 From: Romania Posts: 1 Thanks: 0 Calculate all possible moves of m distinct balls into a N points space We have a n-dimensional finite space formed by N points distributed equidistant in that way: We start from a point named origin, and then put equidistant around it points in n-dimension, layer by layer, in the way that in 2-dimension formed equilateral triangles, in 3-dimension formed regulate tetrahedral, and so on. In that finite space there are, in the way described above, L layers of points around point of origin. We have m number of distinct balls that occupied m points in space N. Every ball has neighbor points that can be occupied or unoccupied by other balls for a reference time step. Every ball can move to one of neighbor unoccupied points in next time step. How can be calculated the maximum number of possible moves that all m balls can do in next time step, no matter of initial position in space N (sum of total possible moves of each ball in next time step)? Please, I need a math formula. If you need more details please tell me. Tags balls, calculate, distinct, moves, points, space Thread Tools Show Printable Version Email this Page Display Modes Linear Mode Switch to Hybrid Mode Switch to Threaded Mode Similar Threads Thread Thread Starter Forum Replies Last Post Skyer Algebra 3 January 6th, 2014 11:26 AM guru123 Algebra 2 June 24th, 2012 04:59 AM metamath101 Algebra 2 June 22nd, 2012 04:59 PM BillT Linear Algebra 0 October 27th, 2011 12:51 PM pascal4542 Complex Analysis 0 April 28th, 2010 09:51 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top      