# Tag Info

### Select a subset in the bit-strings with even 1s overlapped - thank you

list = Permutations[{0, 0, 1, 1}, {4}] (* {{0, 0, 1, 1}, {0, 1, 0, 1}, {0, 1, 1, 0}, {1, 0, 0, 1}, {1, 0, 1, 0}, {1, 1, 0, 0}} *) Compute which ...
• 47.5k

...
• 54.5k
Accepted

### Period of repeating decimal

As written on MathWorld, you can use RealDigits. ...
• 25.3k

### Checking if a number is right sorted

Using SequenceCount f = SequenceCount[Rest @ IntegerDigits[#], x_ /; LessEqual @@ x] == 1 &; f /@ {51369, 51396} {True, ...
• 70.7k

Update ...
• 18.4k

...
• 28.3k

### Select a subset in the bit-strings with even 1s overlapped - thank you

If you want to find all pairs that have even overlap: Select[Tuples[list, 2], EvenQ@*Apply[overlap]] But you said We expect the answer is {{0, 0, 1, 1}, {1, 1, 0, ...
• 28.3k

### Convert integer to words of specific length

Get ways of expressing the number sum as len digits between 1 and 26: ...
• 3,748

A 2-liner? ...
• 3,637

### Period of repeating decimal

To illustrate NestWhileList ...
• 60.9k