Question

Minimum period of function such that $f\left(x+\frac{13}{42}\right)+f(x)=f\left(x+\frac{1}{6}\right)+f\left(x+\frac{1}{7}\right) $

score 771 · Answer 1 · 2026-04-17 07:32:56

771

Views

Minimum period of function such that $f\left(x+\frac{13}{42}\right)+f(x)=f\left(x+\frac{1}{6}\right)+f\left(x+\frac{1}{7}\right) $

Published on 17 Apr 2026 - 7:32

score 611 · Answer 2 · 2026-04-11 03:12:05

611

Views

Solve the following recurrence equation exactly:

Published on 11 Apr 2026 - 3:12

score 331 · Answer 3 · 2026-04-16 00:30:01

331

Views

If $T(n) = un + \sum_i T(\lfloor r_i n \rfloor) $, show that $T(n) = \Theta(n)$

Published on 16 Apr 2026 - 0:30

score 336 · Answer 4 · 2026-04-15 11:18:06

336

Views

Find asymptotic of recurrence sequence

Published on 15 Apr 2026 - 11:18

score 501 · Answer 5 · 2026-04-14 18:27:59

501

Views

discrete math>Recurrence relation>how find the general function of $a(n)=2a(n-1)+n^2$

Published on 14 Apr 2026 - 18:27

score 1.4k · Answer 6 · 2026-04-14 21:56:19

1.4k

Views

Generating function solution to previous question $a_{n}=a_{\lfloor n/2\rfloor}+a_{\lfloor n/3 \rfloor}+a_{\lfloor n/6\rfloor}$

Published on 14 Apr 2026 - 21:56

score 783 · Answer 7 · 2026-04-17 01:36:37

783

Views

Solve $T(n)=2T(\frac{n}3)+\log_3(n)$ for n>1, n a power of 3

Published on 17 Apr 2026 - 1:36

score 3.3k · Answer 8 · 2026-04-15 07:18:23

3.3k

Views

all possible sequences of positive integers that sum upto N and are strictly increasing

Published on 15 Apr 2026 - 7:18

score 335 · Answer 9 · 2026-04-09 14:55:35

335

Views

How to solve a recursive equation

Published on 09 Apr 2026 - 14:55

score 770 · Answer 10 · 2026-04-14 00:39:50

770

Views

Closed form expression for $n_j$ defined by $n_j=\lceil n_{j-1}/b \rceil$

Published on 14 Apr 2026 - 0:39

score 44 · Answer 11 · 2026-04-15 05:47:58

44

Views

Recurrence equation $g(k+n)=\sum_{j=1}^ng(k+n-j)$ and exponential function

Published on 15 Apr 2026 - 5:47

score 195 · Answer 12 · 2026-04-16 14:25:50

195

Views

If $T(n) = \sum_i T(\lfloor r_i n \rfloor) $ for $n \ge 1$, then $T(n)/n \to 0$

Published on 16 Apr 2026 - 14:25

score 516 · Answer 13 · 2026-04-12 04:21:47

516

Views

How to find solutions to the differential equation created by setting the Schwarzian Derivative equal to zero?

Published on 12 Apr 2026 - 4:21

score 679 · Answer 14 · 2026-04-12 13:48:20

679

Views

Step by Step Second Order recurrence relations

Published on 12 Apr 2026 - 13:48

score 2.7k · Answer 15 · 2026-04-16 12:13:57

2.7k

Views

Bounds for $T(n) = 2T(n/2) + n/\lg{n}$

Published on 16 Apr 2026 - 12:13

List Question

Minimum period of function such that $f\left(x+\frac{13}{42}\right)+f(x)=f\left(x+\frac{1}{6}\right)+f\left(x+\frac{1}{7}\right) $

Solve the following recurrence equation exactly:

If $T(n) = un + \sum_i T(\lfloor r_i n \rfloor) $, show that $T(n) = \Theta(n)$

Find asymptotic of recurrence sequence

discrete math>Recurrence relation>how find the general function of $a(n)=2a(n-1)+n^2$

Generating function solution to previous question $a_{n}=a_{\lfloor n/2\rfloor}+a_{\lfloor n/3 \rfloor}+a_{\lfloor n/6\rfloor}$

Solve $T(n)=2T(\frac{n}3)+\log_3(n)$ for n>1, n a power of 3

all possible sequences of positive integers that sum upto N and are strictly increasing

How to solve a recursive equation

Closed form expression for $n_j$ defined by $n_j=\lceil n_{j-1}/b \rceil$

Recurrence equation $g(k+n)=\sum_{j=1}^ng(k+n-j)$ and exponential function

If $T(n) = \sum_i T(\lfloor r_i n \rfloor) $ for $n \ge 1$, then $T(n)/n \to 0$

How to find solutions to the differential equation created by setting the Schwarzian Derivative equal to zero?

Step by Step Second Order recurrence relations

Bounds for $T(n) = 2T(n/2) + n/\lg{n}$

Trending Questions

Popular # Hahtags

Popular Questions