Newbetuts
.
New posts in recursive-algorithms
Numerical method for finding the square-root.
numerical-methods
recurrence-relations
proof-writing
contest-math
recursive-algorithms
Using Horner's Method
polynomials
recursive-algorithms
Worst case analysis of MAX-HEAPIFY procedure .
algorithms
recursive-algorithms
sorting
Recursion tree T(n) = T(n/3) + T(2n/3) + cn
recursive-algorithms
How to tell if a particular number will survive in this sieve?
algorithms
puzzle
recursive-algorithms
sieve-theory
Solving recurrence $T(n) = T(\lceil n/2 \rceil) + T(\lfloor n/2 \rfloor) + \Theta(n)$
algorithms
asymptotics
recurrence-relations
recursive-algorithms
is there a faster method to calculate $1/x$ ($x$ an integer) than this?
elementary-number-theory
numerical-methods
fractions
recursive-algorithms
A 3rd grade math problem: fill in blanks with numbers to obtain a valid equation
algorithms
diophantine-equations
recreational-mathematics
puzzle
recursive-algorithms
Computing sums of divisors in $O(\sqrt n)$ time?
sequences-and-series
number-theory
recursive-algorithms
Solving recurrences with boundary conditions
algorithms
recurrence-relations
recursive-algorithms
Proof of clockwise towers of Hanoi variant recursive solution
algorithms
discrete-mathematics
recurrence-relations
recursive-algorithms
What are the solutions for $a(n)$ and $b(n)$ when $a(n+1)=a(n)b(n)$ and $b(n+1)=a(n)+b(n)$?
real-analysis
recurrence-relations
recursive-algorithms
Algorithm to calculate rating based on multiple reviews (using both review score and quantity)
algorithms
recursive-algorithms
scoring-algorithm
How can $n \lg n = O(n^{log_3 4 - r})$?
algorithms
recursive-algorithms
Finding the asymptotic behavior of the recurrence $T(n)=4T(\frac{n}{2})+n^2$ by using substitution method
algorithms
asymptotics
recurrence-relations
computational-complexity
recursive-algorithms
What is the link between the quotient and the Bézout coefficients in the Extended Euclidean Algorithm?
algorithms
recursive-algorithms
Solve recurrence relation $T(n-2)+2n$
algorithms
recurrence-relations
asymptotics
recursion
recursive-algorithms
Any advantages of using Gödel universal functions in proving unsolvability?
logic
recursion
computability
recursive-algorithms
Recurrence telescoping $T(n) = T(n-1) + 1/n$ and $T(n) = T(n-1) + \log n$
recurrence-relations
recursive-algorithms
Could someone tell me how large this number is?
recursive-algorithms
big-numbers
hyperoperation
Prev
Next