Twelve faces of different colors
Public  02/08/16  15xp  Math  27.3% 
Let there be N distinct colors. Let a_{n} = (a_{n1} + a_{n2}) % 9 with a_{1} = a_{2} = 1 Consider the ways to paint all the faces of dodecahedron using these N distinct colors. If selected, you can use up to a_{i}+2 but no less than 2 of i_{th} color where i = 1 to N. What is the total number of ways to paint a dodecahedron if N = 1000? Answer format: number Example: 652706 if N = 5 or 130992447 if N = 10 [My timing: 2s]
New Members
 gunnez97 2d:19h
 CcGaviria 3w
 wuyingddg 3w
 curiosity_def 3w:1d
 skywalkert 3w:2d
Fresh Problems

Best Matrices Multiplication 2 2d:21h
solved by 7 
Central binomial coefficients 3d:21h
solved by 10 
Harmonic variations 6d:12h
solved by 7 
Special squarefree sum 1w:3d
solved by 5 
A Staggering Sequence 1w:6d
solved by 11