MATH
Login Or Sign up

List Question

15
327
Views

Simplify Permutation Inversion Count Recurrence

Published on
#combinatorics #summation #permutations #recurrence-relations
110
Views

Calculate floor of $\frac{1}{x_1 + 1} + \frac{1}{x_2 + 1} + ... + \frac{1}{x_{100} + 1}$

Published on
#number-theory #recurrence-relations #ceiling-and-floor-functions
86
Views

Determining order class of $T(n) = n\cdot T(\frac{n}{2}) + 1$ with $T(1) = 1$

Published on
#recurrence-relations #asymptotics
46
Views

Solving With Iteration

Published on
#algorithms #recurrence-relations
366
Views

How to find minimal distances route for a trip of $t$ days, given distances for each stop?

Published on
#optimization #algorithms #recurrence-relations #dynamic-programming
45
Views

Examine the behaviour of a non-linear system

Published on
#ordinary-differential-equations #recurrence-relations #dynamical-systems
1.2k
Views

Use recursion to prove the bounds of the Fibonacci numbers when $n\geq 2$

Published on
#recurrence-relations #recursion #fibonacci-numbers #upper-lower-bounds #python
77
Views

Sequence such that $a_{k-1}+a_k=a_{k+1}$ and $a_k>0$ for all $k\in\mathbb{Z}$

Published on
#sequences-and-series #recurrence-relations
126
Views

Closed form of $u_n$ with $u_{0} =1$ and $u_n=\frac{1}{3}u_{n-1}-1$?

Published on
#sequences-and-series #recurrence-relations #closed-form
82
Views

find closed form for recurrence relation using generating function. terminate exercise

Published on
#sequences-and-series #recurrence-relations #generating-functions
209
Views

$a_n $ is a positive integer for any $n\in \mathbb {N} $.

Published on
#sequences-and-series #induction #recurrence-relations
65
Views

Solve recurrent ODE (elegantly?)

Published on
#ordinary-differential-equations #recurrence-relations #perturbation-theory
86
Views

What does it mean to have a recurrence $T(n) = 2T(n)$

Published on
#algorithms #recurrence-relations #recursive-algorithms
57
Views

uniqueness of mathematical induction

Published on
#functions #discrete-mathematics #recurrence-relations
216
Views

Show why the equation $F_{2n}=F_{n}^{2}+F_{n-1}^{2}$ is correct by taking an example from the staircase problem

Published on
#combinatorics #recurrence-relations #fibonacci-numbers

Trending Questions

Popular # Hahtags

geometry circles algebraic-number-theory functions real-analysis elementary-set-theory proof-verification proof-writing number-theory elementary-number-theory puzzle game-theory calculus multivariable-calculus partial-derivative complex-analysis logic set-theory second-order-logic homotopy-theory winding-number ordinary-differential-equations numerical-methods derivatives integration definite-integrals probability limits sequences-and-series algebra-precalculus

Popular Questions

Copyright © 2021 JogjaFile Inc.