MATH
Login Or Sign up

List Question

15
81
Views

Leading asymptotic term of the nonlinear first-order recurrence $a_n=a_{n-1}+\sqrt{a_{n-1}}$

Published on
#asymptotics #recurrence-relations #recursion
61
Views

For all integer $n$, prove that $U_n \geq n + 1$

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

Can any repeating sequence be expressed in a generating function?

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

Unable to understand the base cases for this recurrence relation: DPn = DPn-1 + DPn-3 + DPn-4

Published on
#recurrence-relations #integer-partitions #dynamic-programming
234
Views

Find number of legal codes containing even number of zeros

Published on
#combinatorics #permutations #recurrence-relations #recursion #combinatorics-on-words
91
Views

Prove limit of non linear recursive sequence

Published on
#sequences-and-series #limits #recurrence-relations
74
Views

Counting integers in the Thue-Morse sequence

Published on
#sequences-and-series #combinatorics #number-theory #discrete-mathematics #recurrence-relations
87
Views

Finding a recurrence relation to evaluate $\int_{a}^{1}\mathrm{d}x\,\frac{x^{n}}{\sqrt{1-x^{2}}}\ln{\left(\frac{x+a}{x-a}\right)}$

Published on
#definite-integrals #recurrence-relations #special-functions #closed-form #polylogarithm
58
Views

Counting number of derangements with extra numbers without an index

Published on
#combinatorics #recurrence-relations #problem-solving #derangements
85
Views

What is the explicit formula for the n-th term of this series?

Published on
#sequences-and-series #recurrence-relations #recursive-algorithms
213
Views

Finding closed form of the following recurrence relation

Published on
#discrete-mathematics #recurrence-relations
86
Views

Wronskian equivalent for difference equations?

Published on
#recurrence-relations #wronskian
59
Views

Help solving a non-homogenous recurrence relation

Published on
#discrete-mathematics #recurrence-relations
100
Views

How do I prove that $T(n) = 4T(n/2) + n^{1.7}$ is $O(n^2)$ time complexity

Published on
#asymptotics #recurrence-relations #upper-lower-bounds
86
Views

Differential-difference equation solution

Published on
#integration #number-theory #recurrence-relations #analytic-number-theory

Trending Questions

Popular # Hahtags

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

Popular Questions

Copyright © 2021 JogjaFile Inc.