Skip to main content
MathOverflow

Return to Question

Post Closed as "too localized" by Will Jagy, Felipe Voloch, Chandan Singh Dalawat, Andy Putman, Suvrit
added 55 characters in body; added 1 characters in body
Source Link
iensen
iensen
  • 31
  • 1
  • 4

I'm stuck on the following reccurrence :

T(N)=T(N/LOGN)+1,IF N>2
T(N)=0,if 0<=N<=2

I need a function T(N) for all N>0 Is there some method for solving it? Can we at least get some tight asymptotic bounds for T(N)?

UPD1: LOG is binary logarithm, log with base 2.

I'm stuck on the following reccurrence :

T(N)=T(N/LOGN)+1,IF N>2
T(N)=0,if 0<=N<=2

I need a function T(N) for all N>0 Is there some method for solving it? Can we at least get some tight asymptotic bounds for T(N)?

I'm stuck on the following reccurrence :

T(N)=T(N/LOGN)+1,IF N>2
T(N)=0,if 0<=N<=2

I need a function T(N) for all N>0 Is there some method for solving it? Can we at least get some tight asymptotic bounds for T(N)?

UPD1: LOG is binary logarithm, log with base 2.

Source Link
iensen
iensen
  • 31
  • 1
  • 4

Recurrence T(N)=T(N/LOGN)+1

I'm stuck on the following reccurrence :

T(N)=T(N/LOGN)+1,IF N>2
T(N)=0,if 0<=N<=2

I need a function T(N) for all N>0 Is there some method for solving it? Can we at least get some tight asymptotic bounds for T(N)?