348 reputation
113
bio website
location USA
age 22
visits member for 2 years, 2 months
seen Apr 5 at 23:21

Senior in Mathematics/CS


May
6
comment How many possible ways to pick 4 items from a collection of 20?
This is the correct number of permutations, not the correct number of combinations. You need to remove the cases where you select the same four students in different order
May
6
awarded  Custodian
May
6
comment How many possible ways to pick 4 items from a collection of 20?
@Cortizol - thanks for the edit, that looks much nicer
May
6
reviewed Approve suggested edit on How many possible ways to pick 4 items from a collection of 20?
May
6
answered How many possible ways to pick 4 items from a collection of 20?
May
6
awarded  Caucus
May
2
comment How to find the error term for multiple applications of a method
@Amzoti - I did not read carefully enough - I found the same formula in another part of the book. Thanks for the help!
May
2
accepted How to find the error term for multiple applications of a method
May
2
comment How to find the error term for multiple applications of a method
I didn't know that was a formula for the second derivative, that's why. Let me do some work
May
2
asked How to find the error term for multiple applications of a method
Apr
22
accepted How to use undefined value in Composite Simpson's Rule
Apr
22
comment How to use undefined value in Composite Simpson's Rule
Excellent, thanks!
Apr
22
comment How to use undefined value in Composite Simpson's Rule
So it's $0$, right? I couldn't figure it out (before I got this answer), and just left that part as $0$, and the answer matched the back of the book. It's because we don't need to worry about $sin{\infty}$, because it will always be between $-1$ and $1$, and so when multiplied by $0$, it will be $0$?
Apr
22
asked How to use undefined value in Composite Simpson's Rule
Apr
19
comment Prove that a greedy algorithm selects the maximum number of programs
Ahh! $a(1)$ could be any number from $1$ up to the highest number that allows $a(l)$ to be $n$, right? ($n-l$, I think)
Apr
19
comment Prove that a greedy algorithm selects the maximum number of programs
It seems to me that $a(k) = k$. I'm not sure why I'm just getting stuck on this part
Apr
19
comment Prove that a greedy algorithm selects the maximum number of programs
Why is that? $a(1) \geq 1$?
Apr
19
comment Prove that a greedy algorithm selects the maximum number of programs
Should the sentence be "since $a(k)$ is an increasing sequence, we have $$a(l) \geq k \implies P_{a(l)} \geq P_k$$"?
Apr
18
accepted Prove that a greedy algorithm selects the maximum number of programs
Apr
18
asked Prove that a greedy algorithm selects the maximum number of programs