meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | 21 | |
| visits | member for | 8 months |
| seen | May 8 at 16:48 | |
| stats | profile views | 6 |
I'm a Computer Science student at the University of Georgia, but I do a lot of school-unrelated programming because I love it. Currently, I'm mainly using/learning Haskell.
GitHub
My Blog
Project Euler (Haskell)
Project Euler (Groovy)
Twitter
|
May 3 |
accepted | How to prove this set is denumerable? |
|
May 3 |
comment |
How to prove this set is denumerable? We're not including $0$ in $\mathbb{N}$ in this class, so actually the function $f(x) = x^2 + 1$ works fine in my case. I was thinking of a way to build $\mathbb{N} - \left\{n^2 \: | \: n \in \mathbb{N} \right\}$ instead of a subset of it, which was the problem. Seeing subsets makes a lot more sense. Thanks for the reply. |
|
May 3 |
comment |
How to prove this set is denumerable? @ChrisDugale So the difference between squares is at least 3, and since there are infinitely many squares, there are at least 3 times as many non-squares? And since the set of squares is infinite, then surely a set at least three times that size is infinite? Something like that? |
|
May 3 |
asked | How to prove this set is denumerable? |
|
Jan 21 |
accepted | How to find the order of a recurrence relation |
|
Jan 21 |
comment |
How to find the order of a recurrence relation @MarkoRiedel That's actually exactly what I needed -- the Master Theorem. I was able to get the information I needed with a simple Google search for it. Thanks! |
|
Jan 21 |
asked | How to find the order of a recurrence relation |
|
Nov 28 |
accepted | Solving systems of basic congruences |
|
Nov 28 |
comment |
Solving systems of basic congruences Thank you. Yeah, I just noticed that the moduli must be coprime. I think I understand the process now, though. Thanks! |
|
Nov 28 |
comment |
Solving systems of basic congruences I've been trying to solve this with the Chinese Remainder Theorem as stated in the comments above, and it looks like it's unsolvable. Is that true? Could you (or anyone) check it? |
|
Nov 28 |
comment |
Solving systems of basic congruences Thank you both! |
|
Nov 28 |
asked | Solving systems of basic congruences |
|
Nov 17 |
awarded | Teacher |
|
Nov 15 |
answered | Too old to start math |
|
Nov 15 |
awarded | Scholar |
|
Nov 15 |
accepted | Describing a sequence of terms |
|
Nov 15 |
comment |
Describing a sequence of terms Okay, thank you! I'll go ahead and assume that's what he was asking for, then. |
|
Nov 15 |
comment |
Describing a sequence of terms I think this is actually what he was talking about, thank you! I'm confused about how to actually use it, though. Do you think that, the way this question was posed, he may have meant for us to simply write out a period of the generated PRNG sequence? That's my thought, but I just want to make sure that there's no other way to "describe the sequence." |
|
Nov 15 |
awarded | Student |
|
Nov 15 |
awarded | Editor |
