Combinations with repetitions/Square digit chain: Difference between revisions
Content added Content deleted
No edit summary |
|||
| Line 3: | Line 3: | ||
The purpose of this task is to combine these tasks as follows: |
The purpose of this task is to combine these tasks as follows: |
||
:The |
:The sets of k items will be taken from [0,1,4,9,16,25,36,49,64,81] and must be obtained using code from [[Combinations with repetitions]] |
||
:For each set of k items determine if it translates to 1 using the rules from [[Iterated digits squaring]] |
:For each set of k items determine if it translates to 1 using the rules from [[Iterated digits squaring]] |
||
:For each set which translates to 1 determine the number of different ways, c say, in which the k items can be uniquely ordered |
:For each set which translates to 1 determine the number of different ways, c say, in which the k items can be uniquely ordered |
||