## Search found 8 matches

- Mon Jul 09, 2012 11:08 pm UTC
- Forum: Logic Puzzles
- Topic: Ten Pin Bowling Score
- Replies:
**9** - Views:
**5459**

### Re: Ten Pin Bowling Score

I'ma necro this thread, because someone is WRONG on the Internet. Can't have that, right? We know a is 5, so we fill that in. e+f is 5, but we cannot gain any more information about that. The score: (25) + (15+b) + (5+b) + (19) + (20) + (30) + (20+...

- Thu Jun 07, 2012 5:11 am UTC
- Forum: Mathematics
- Topic: Hahn Series not a Field
- Replies:
**5** - Views:
**2202**

### Re: Hahn Series not a Field

If a non-trivial statement is the basis for your argument, you absolutely need to prove it. You seem to think the proof is trivial by transfinite induction, but I can't make the limit case work. Perhaps you have an argument that you would like to share? In any case, you have other issues. Assuming t...

- Tue Jun 05, 2012 11:47 pm UTC
- Forum: Mathematics
- Topic: Hahn Series not a Field
- Replies:
**5** - Views:
**2202**

### Re: Hahn Series not a Field

Your argument seems to rely on the claim that

[math]\sum_0^{\sigma}{t^k} = \frac{1-t^{\sigma + 1}}{1-t}.[/math]

Can you prove that this is true, even if [imath]\sigma[/imath] is not a finite value? Better yet, what value group are you using, and to what value in that group does an infinite [imath]\sigma[/imath] correspond?

[math]\sum_0^{\sigma}{t^k} = \frac{1-t^{\sigma + 1}}{1-t}.[/math]

Can you prove that this is true, even if [imath]\sigma[/imath] is not a finite value? Better yet, what value group are you using, and to what value in that group does an infinite [imath]\sigma[/imath] correspond?

- Sun Apr 22, 2012 1:44 am UTC
- Forum: Mathematics
- Topic: Looking for a graph algorithm
- Replies:
**11** - Views:
**3964**

### Re: Looking for a graph algorithm

When you say "From each node, we can place one outgoing edge," do you mean that each node must have an outgoing edge? If so, then any solution you create will necessarily have a cycle. Even if it's not mandatory, I can't see how adding an outgoing edge to a vertex that doesn't have one wo...

- Sat Apr 21, 2012 4:06 am UTC
- Forum: Mathematics
- Topic: Looking for a graph algorithm
- Replies:
**11** - Views:
**3964**

### Re: Looking for a graph algorithm

When you say "From each node, we can place one outgoing edge," do you mean that each node must have an outgoing edge? If so, then any solution you create will necessarily have a cycle. Even if it's not mandatory, I can't see how adding an outgoing edge to a vertex that doesn't have one wou...

- Sun Mar 11, 2012 1:37 am UTC
- Forum: Coding
- Topic: Where are XP password hashes stored?
- Replies:
**4** - Views:
**7958**

### Re: Where are XP password hashes stored?

Why do you want this?

- Sun Feb 19, 2012 6:15 am UTC
- Forum: Mathematics
- Topic: Distance between two points on/in an ellipse
- Replies:
**6** - Views:
**3775**

### Re: Distance between two points on/in an ellipse

Do you know how to do implicit differentiation? It might help you here.

- Fri Feb 10, 2012 6:14 am UTC
- Forum: Computer Science
- Topic: What to do?
- Replies:
**21** - Views:
**4485**

### Re: What to do?

I want to clarify something. You're claiming you have an algorithm that

- takes, as input, a set [imath]S[/imath] containing [imath]n[/imath] integers,

- returns a list of all the subsets of [imath]S[/imath] that sum to 0, and

- finishes in time that is polynomial in [imath]n[/imath] for all [imath]S[/imath].

Is this a correct characterization?

- takes, as input, a set [imath]S[/imath] containing [imath]n[/imath] integers,

- returns a list of all the subsets of [imath]S[/imath] that sum to 0, and

- finishes in time that is polynomial in [imath]n[/imath] for all [imath]S[/imath].

Is this a correct characterization?