Question

Number of ways in arranging $5$ $6$-sided dices such that the digits on the 'top faces' form a $5$-digit prime, whose sum of its digits is prime?

score 55 · Answer 1 · 2026-04-13 05:47:43

55

Views

Number of ways in arranging $5$ $6$-sided dices such that the digits on the 'top faces' form a $5$-digit prime, whose sum of its digits is prime?

Published on 13 Apr 2026 - 5:47

score 107 · Answer 2 · 2026-03-26 14:20:24

107

Views

Has the idea of a 'hyperbolic Theta function' been studied?

Published on 26 Mar 2026 - 14:20

score 297 · Answer 3 · 2026-04-06 14:20:23

297

Views

Change the Recursive Relation into Formula : $f(n,k) = f(n-1,k) + f(n-2, k-1)$

Published on 06 Apr 2026 - 14:20

score 117 · Answer 4 · 2017-11-02 00:39:56

117

Views

Extracting a closed form for the coefficients of the generating function $\frac{x e^x}{(1 - x)^2}$

Published on 02 Nov 2017 - 0:39

score 2.4k · Answer 5 · 2026-04-12 12:55:20

2.4k

Views

Generating series of binary strings that don't contain substring $1100$

Published on 12 Apr 2026 - 12:55

score 329 · Answer 6 · 2026-04-11 16:59:13

329

Views

Counting set for generating functions

Published on 11 Apr 2026 - 16:59

score 243 · Answer 7 · 2017-11-03 19:27:24

243

Views

Exponential Generating Functions With Coefficients

Published on 03 Nov 2017 - 19:27

score 556 · Answer 8 · 2026-04-13 15:56:40

556

Views

Find a generating function and a closed form for the sequence $c_{n+1} = \sum_{i=0}^{n}c_i$

Published on 13 Apr 2026 - 15:56

score 223 · Answer 9 · 2026-04-09 06:46:30

223

Views

Easier method to extract coefficients from generating function

Published on 09 Apr 2026 - 6:46

score 44 · Answer 10 · 2017-11-06 05:49:24

44

Views

Find a generating function for the recurrence relation given by $b_{n+1} = 3b_{n} + 2^{n}$, $b_{0} = 1$.

Published on 06 Nov 2017 - 5:49

score 62 · Answer 11 · 2026-04-13 13:30:55

62

Views

Is there a way to solve the following series?

Published on 13 Apr 2026 - 13:30

score 421 · Answer 12 · 2017-11-06 10:31:28

421

Views

Generating function: $a_n = \sum\limits_{k=0}^n \frac{1}{k + 1} {{n + k} \choose {n - k}} {{2k} \choose {k}}$

Published on 06 Nov 2017 - 10:31

score 62 · Answer 13 · 2026-04-12 19:27:55

62

Views

Finding an explicit expression for a recurrence relation from the generating function

Published on 12 Apr 2026 - 19:27

score 297 · Answer 14 · 2026-04-09 11:22:34

297

Views

Explicit formula for recurrence relation by generating function

Published on 09 Apr 2026 - 11:22

score 123 · Answer 15 · 2026-04-10 08:37:18

123

Views

Generating function for recurrence

Published on 10 Apr 2026 - 8:37

List Question

Number of ways in arranging $5$ $6$-sided dices such that the digits on the 'top faces' form a $5$-digit prime, whose sum of its digits is prime?

Has the idea of a 'hyperbolic Theta function' been studied?

Change the Recursive Relation into Formula : $f(n,k) = f(n-1,k) + f(n-2, k-1)$

Extracting a closed form for the coefficients of the generating function $\frac{x e^x}{(1 - x)^2}$

Generating series of binary strings that don't contain substring $1100$

Counting set for generating functions

Exponential Generating Functions With Coefficients

Find a generating function and a closed form for the sequence $c_{n+1} = \sum_{i=0}^{n}c_i$

Easier method to extract coefficients from generating function

Find a generating function for the recurrence relation given by $b_{n+1} = 3b_{n} + 2^{n}$, $b_{0} = 1$.

Is there a way to solve the following series?

Generating function: $a_n = \sum\limits_{k=0}^n \frac{1}{k + 1} {{n + k} \choose {n - k}} {{2k} \choose {k}}$

Finding an explicit expression for a recurrence relation from the generating function

Explicit formula for recurrence relation by generating function

Generating function for recurrence

Trending Questions

Popular # Hahtags

Popular Questions