Question

Finding the number of $n$-words which can be formed under the given conditions.

score 48 · Answer 1 · 2021-04-30 09:07:11

48

Views

Finding the number of $n$-words which can be formed under the given conditions.

Published on 30 Apr 2021 - 9:07

score 63 · Answer 2 · 2021-04-30 09:15:56

63

Views

How many $n$-words from the alphabet $A=${$a,b,c,d$} are there such that $a$ and $b$ are never neighbors.

Published on 30 Apr 2021 - 9:15

score 26 · Answer 3 · 2021-05-18 15:07:12

how many words can be created with $12$ characters which includes $4$ Cs and $5$ Ds and any other letter of the alphabet? (statistics and probability)

score 141 · Answer 4 · 2021-05-22 05:26:41

141

Views

A bus has to visit three cities, each of them four times.The number of ways it call be done if bus is not allowed to start and end in the same city is

Published on 22 May 2021 - 5:26

score 1.3k · Answer 5 · 2021-05-23 16:15:15

1.3k

Views

How many words can you create of length 6 with given properties?

Published on 23 May 2021 - 16:15

score 13 · Answer 6 · 2021-05-30 17:24:29

13

Views

Eventual combinatorial rank of iterates of substitutions

Published on 30 May 2021 - 17:24

score 81 · Answer 7 · 2026-02-23 18:40:48

81

Views

Probability that $010$ is present in an $n$-length binary sequence

Published on 23 Feb 2026 - 18:40

score 152 · Answer 8 · 2021-06-04 05:59:34

152

Views

Generating function for runs in alphabets

Published on 04 Jun 2021 - 5:59

score 243 · Answer 9 · 2021-06-09 19:54:14

243

Views

Number of $n$ length word that can be formed using the alphabets $a$, $b$, $c$, $d$ such that $a$ and $b$ never come together.

Published on 09 Jun 2021 - 19:54

score 304 · Answer 10 · 2021-06-11 19:03:39

304

Views

Find a recurrence relation for the number of bit strings of length $n$ by Goulden-Jackson

Published on 11 Jun 2021 - 19:03

score 132 · Answer 11 · 2021-06-18 12:52:08

132

Views

Recursive factorization of words

Published on 18 Jun 2021 - 12:52

score 163 · Answer 12 · 2021-07-02 13:57:59

163

Views

How many strings are there of length $ n $ over $ \{ 1,2,3,4,5,6 \} $ s.t. the sum of all characters in the string divide by $ 3 $.

Published on 02 Jul 2021 - 13:57

score 70 · Answer 13 · 2021-07-09 02:54:13

70

Views

Number of ways to transform binary sequences into another one using given operations

Published on 09 Jul 2021 - 2:54

score 2k · Answer 14 · 2021-07-09 20:39:27

2k

Views

Arrangements of 3 red beads, 3 green beads, and 3 blue beads if rotations/reflections are the same and no 2 consecutive beads are the same color

Published on 09 Jul 2021 - 20:39

score 453 · Answer 15 · 2021-07-11 19:37:24

453

Views

Counting words of length $n$ from $k$-sized alphabet with no substring of $k$ consecutive distinct letters

Published on 11 Jul 2021 - 19:37

List Question

Finding the number of $n$-words which can be formed under the given conditions.

How many $n$-words from the alphabet $A=${$a,b,c,d$} are there such that $a$ and $b$ are never neighbors.

how many words can be created with $12$ characters which includes $4$ Cs and $5$ Ds and any other letter of the alphabet? (statistics and probability)

A bus has to visit three cities, each of them four times.The number of ways it call be done if bus is not allowed to start and end in the same city is

How many words can you create of length 6 with given properties?

Eventual combinatorial rank of iterates of substitutions

Probability that $010$ is present in an $n$-length binary sequence

Generating function for runs in alphabets

Number of $n$ length word that can be formed using the alphabets $a$, $b$, $c$, $d$ such that $a$ and $b$ never come together.

Find a recurrence relation for the number of bit strings of length $n$ by Goulden-Jackson

Recursive factorization of words

How many strings are there of length $ n $ over $ \{ 1,2,3,4,5,6 \} $ s.t. the sum of all characters in the string divide by $ 3 $.

Number of ways to transform binary sequences into another one using given operations

Arrangements of 3 red beads, 3 green beads, and 3 blue beads if rotations/reflections are the same and no 2 consecutive beads are the same color

Counting words of length $n$ from $k$-sized alphabet with no substring of $k$ consecutive distinct letters

Trending Questions

Popular # Hahtags

Popular Questions