Question

$f(n) = \mathcal{O}(g(n))$ then $\prod_{i=1}^n f(i) = \mathcal{O} \left( \prod_{j=1}^n g(j) \right)$?

score 42 · Answer 1 · 2026-03-26 01:29:12

42

Views

$f(n) = \mathcal{O}(g(n))$ then $\prod_{i=1}^n f(i) = \mathcal{O} \left( \prod_{j=1}^n g(j) \right)$?

Published on 26 Mar 2026 - 1:29

score 160 · Answer 2 · 2026-03-24 20:33:26

160

Views

On a statement in The Joy of Factoring By Samuel S. Wagstaff (Jr.)?

Published on 24 Mar 2026 - 20:33

score 1.6k · Answer 3 · 2018-04-18 07:51:17

1.6k

Views

Understanding Bayesian Online Change Point Detection (BOCPD)

Published on 18 Apr 2018 - 7:51

score 65 · Answer 4 · 2026-03-26 22:18:08

65

Views

How to solve the recurrence $a_{0}=1 , (n+1)a_{n+1}=a_{n}+(\frac{1}{n!}), n\geq 0$

Published on 26 Mar 2026 - 22:18

score 43 · Answer 5 · 2026-03-25 15:57:19

43

Views

Specific solutions of a random binary underdetermined linear system

Published on 25 Mar 2026 - 15:57

score 218 · Answer 6 · 2026-03-25 16:02:14

218

Views

How many paths of length $n$ with the same start and end point can be found on a hexagonal grid?

Published on 25 Mar 2026 - 16:02

score 62 · Answer 7 · 2026-03-27 09:47:50

62

Views

$\sum_{i=1}^n g(i) = \mathcal{O}(\sum_{i=1}^n h(i))$ imply that $g(n) = \mathcal{O}(h(n))$

Published on 27 Mar 2026 - 9:47

score 43 · Answer 8 · 2026-03-25 08:04:55

43

Views

How to build and operate with floor plan trees/graphs

Published on 25 Mar 2026 - 8:04

score 319 · Answer 9 · 2018-04-18 21:50:27

319

Views

Graph theory: path of X cost between two nodes

Published on 18 Apr 2018 - 21:50

score 1.4k · Answer 10 · 2026-03-25 09:22:30

1.4k

Views

Solving a linear program with (sub) gradient descent

Published on 25 Mar 2026 - 9:22

score 170 · Answer 11 · 2026-03-25 01:13:13

170

Views

Computing generators of polynomial rings (software/algorithm)

Published on 25 Mar 2026 - 1:13

score 101 · Answer 12 · 2018-04-19 10:39:08

101

Views

How to represent a vector as a linear combination of minimal number of other given vectors?

Published on 19 Apr 2018 - 10:39

score 1.1k · Answer 13 · 2026-03-25 23:35:07

1.1k

Views

Time complexity “polynomial in n”

Published on 25 Mar 2026 - 23:35

score 41 · Answer 14 · 2026-03-26 01:29:13

41

Views

$g(n)=\omega (1)$ then for every $k∈\mathbb{N} $ implies $g(n^{k+1}))-g(n^k)= \Theta(g(n^{k+1}))$?

Published on 26 Mar 2026 - 1:29

score 208 · Answer 15 · 2018-04-19 22:50:10

208

Views

Line Intersection - Queries

Published on 19 Apr 2018 - 22:50

List Question

$f(n) = \mathcal{O}(g(n))$ then $\prod_{i=1}^n f(i) = \mathcal{O} \left( \prod_{j=1}^n g(j) \right)$?

On a statement in The Joy of Factoring By Samuel S. Wagstaff (Jr.)?

Understanding Bayesian Online Change Point Detection (BOCPD)

How to solve the recurrence $a_{0}=1 , (n+1)a_{n+1}=a_{n}+(\frac{1}{n!}), n\geq 0$

Specific solutions of a random binary underdetermined linear system

How many paths of length $n$ with the same start and end point can be found on a hexagonal grid?

$\sum_{i=1}^n g(i) = \mathcal{O}(\sum_{i=1}^n h(i))$ imply that $g(n) = \mathcal{O}(h(n))$

How to build and operate with floor plan trees/graphs

Graph theory: path of X cost between two nodes

Solving a linear program with (sub) gradient descent

Computing generators of polynomial rings (software/algorithm)

How to represent a vector as a linear combination of minimal number of other given vectors?

Time complexity “polynomial in n”

$g(n)=\omega (1)$ then for every $k∈\mathbb{N} $ implies $g(n^{k+1}))-g(n^k)= \Theta(g(n^{k+1}))$?

Line Intersection - Queries

Trending Questions

Popular # Hahtags

Popular Questions