Jump to content

  • Log In with Google      Sign In   
  • Create Account

#ActualTournicoti

Posted 22 February 2013 - 04:56 AM

I can express my problem more simply : given an integer, how to find all the decompositions into 3 additions (of positive values) ?

 

in my example of distance=1, this is just

1+0+0

0+1+0

0+0+1

 

so 3*2 permutations due to the opposite values

 

Thanks for reading


#2Tournicoti

Posted 22 February 2013 - 04:56 AM

I can express my problem more simply : given an integer, how to find all the decompositions into 3 additions (of positive values) ?

 

in my example of distance=1, this is just

1+0+0

0+1+0

0+0+1

 

so 3*2 permutations due to the opposites values

 

Thanks for reading


#1Tournicoti

Posted 22 February 2013 - 04:55 AM

I can express my problem more simply : given an integer, how to find all the decompositions into 3 additions ?

 

in my example of distance=1, this is just

1+0+0

0+1+0

0+0+1

 

so 3*2 permutations due to the opposites values

 

Thanks for reading


PARTNERS