MATH
Login Or Sign up

List Question

15
818
Views

How do I solve this linear recurrence equation $C(n) = C(n − 1) + 2n − 1$, where $C(1) =0?$

Published on
#recurrence-relations #recursion #recursive-algorithms
166
Views

Prove existence of non-computable double argument function

Published on
#discrete-mathematics #computability #recursive-algorithms
64
Views

Does this sequence of Euclidean projections converge?

Published on
#sequences-and-series #convex-analysis #recursion #recursive-algorithms #convex-geometry
350
Views

Recursive Calls in Euclidean Algorithm

Published on
#discrete-mathematics #modular-arithmetic #recursion #recursive-algorithms #euclidean-algorithm
40
Views

Construct following semidecidable sets

Published on
#discrete-mathematics #computability #recursive-algorithms
73
Views

Proof such recursive set existence.

Published on
#discrete-mathematics #computational-complexity #computability #recursive-algorithms
61
Views

Build a chain of sets $(A_{k})_{k \in \mathbb{N}}$

Published on
#discrete-mathematics #computability #recursive-algorithms
100
Views

How often can I divide a number until I hit a certain limit.

Published on
#recurrence-relations #exponential-function #divisibility #recursive-algorithms
50
Views

How do I solve this recurrence?

Published on
#discrete-mathematics #proof-writing #induction #recurrence-relations #recursive-algorithms
253
Views

Solve recurrence relation $T(n)=n^{1/5}T(n^{4/5})+5n/4$.

Published on
#algorithms #recursive-algorithms
38
Views

how can I calculate the sum of the lower triangular in O(1)?

Published on
#algorithms #recursive-algorithms
61
Views

Defining and generalizing a recursive function applied $n$ times

Published on
#recurrence-relations #recursion #recursive-algorithms
70
Views

Can somebody help me with this mathematical induction proof?

Published on
#induction #recursive-algorithms
297
Views

A computably enumerable set $m$-reduces to the halting problem

Published on
#logic #recursion #computability #recursive-algorithms
56
Views

The answer of a recursive equation: $T(n) = T(n /\log(n)) + 1$

Published on
#recursion #recursive-algorithms

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.