956 reputation
312
bio website lxr.linux.no
location Jerusalem, Israel
age 36
visits member for 3 years
seen Mar 15 at 17:41

I'm a self taught programmer whose taken a break to go back to school and study Software Engineering. Currently, my main area's of interest are network programming and application level protocols, object oriented design and methodologies like Agile and TDD.


Apr
10
awarded  Yearling
Mar
15
comment Given an Alphabet, how many words can you make with these restrictions.
Why was this question marked down, especially more than two years after it was asked?
Feb
14
revised How to study for a test and how to know if you're just not good at math?
spelling mistake
Feb
13
answered How to study for a test and how to know if you're just not good at math?
Feb
12
awarded  Popular Question
Dec
12
awarded  Popular Question
Nov
6
revised Is math built on assumptions?
minor grammer corrections
Nov
6
suggested suggested edit on Is math built on assumptions?
Apr
10
awarded  Yearling
Feb
12
accepted A Recurrence relations of the form: $T(n) = aT(\frac{n}{b}) + f(n)$
Feb
12
revised A Recurrence relations of the form: $T(n) = aT(\frac{n}{b}) + f(n)$
added 177 characters in body
Feb
12
comment A Recurrence relations of the form: $T(n) = aT(\frac{n}{b}) + f(n)$
$a,b\in \mathbb{N}$
Feb
12
revised A Recurrence relations of the form: $T(n) = aT(\frac{n}{b}) + f(n)$
edited title
Feb
12
asked A Recurrence relations of the form: $T(n) = aT(\frac{n}{b}) + f(n)$
Feb
12
accepted When is a linear recurrence relation solvable?
Feb
12
comment When is a linear recurrence relation solvable?
OK, I looked up Galois Theory I think I get it now ( in a rudimentary sense ). A homogeneous linear recurrence relation with constant coefficients will only have a closed form if it's Galois Group is solvable, which is only always true for polynomials of order 4 or less. Is that more or less correct?
Feb
11
comment When is a linear recurrence relation solvable?
Aren't real? So in addition to being linear, having constant coefficients and being homogeneous, the characteristic equation has to have real roots in order for there to be a closed form?
Feb
11
comment When is a linear recurrence relation solvable?
I'm a little confused. It seems like one of the major cases where I can always find a closed form is when the recurrence is linear, has constant coefficients, and is homogeneous. But then you say, "Of course, there may be no closed form for the roots of this polynomial." Could you maybe explain a little more? Thanks.
Feb
10
revised When is a linear recurrence relation solvable?
assumed that you meant linear difference equations, not differential equations
Feb
10
comment When is a linear recurrence relation solvable?
@GerryMyerson Can I find a closed form.