meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | 18 | |
| visits | member for | 6 months |
| seen | Mar 25 at 12:45 | |
| stats | profile views | 37 |
Just started first year in Computer Science, Which means I have mostly math courses: Calculus 1, Linear Algebra 1 and Discrete math.
|
Nov 14 |
comment |
Proving the sup of $\{\frac{n-m}{n+m}|n,m\in \mathbb{N}, m<n\}$ oh yeah, I see... Damn it's annoying being stuck on a question because you accidently turned a sign around... Thanks! |
|
Nov 14 |
asked | Proving the sup of $\{\frac{n-m}{n+m}|n,m\in \mathbb{N}, m<n\}$ |
|
Nov 12 |
awarded | Commentator |
|
Nov 7 |
accepted | Proving a set of functions from $\mathbb{N}$ to $\{1,0\}$ is countable |
|
Nov 7 |
revised |
Proving a set of functions from $\mathbb{N}$ to $\{1,0\}$ is countable added 300 characters in body |
|
Nov 7 |
comment |
Proving a set of functions from $\mathbb{N}$ to $\{1,0\}$ is countable actually we didn't talk at all about of $\mathbb{N}^n$ like that. unless I missed a lot more then I can remember |
|
Nov 7 |
comment |
Proving a set of functions from $\mathbb{N}$ to $\{1,0\}$ is countable I tried looking at the private case of $|f^{-1}(\{1\})|=1$, But I'm not exactly sure how to write it. I understand that exists a function $g$ that maps every $n\in\mathbb{N}$ to the function for which $f(n)=1$, but how do I write it formally? |
|
Nov 6 |
comment |
Proving a set of functions from $\mathbb{N}$ to $\{1,0\}$ is countable Yep, these are the functions I try to prove there are countably infinite number of. |
|
Nov 6 |
revised |
Proving a set of functions from $\mathbb{N}$ to $\{1,0\}$ is countable added 417 characters in body |
|
Nov 6 |
asked | Proving a set of functions from $\mathbb{N}$ to $\{1,0\}$ is countable |
|
Nov 4 |
accepted | proving a simple function is bijective |
|
Nov 4 |
comment |
proving a simple function is bijective If you'll look at the edit you'll see that's exactly where I was when asking in the first place. Well, it's my fault for trying to post questions while on a bus. I got my answer I think , ty... |
|
Nov 4 |
comment |
proving a simple function is bijective how do I explain this function is infact bijective? |
|
Nov 4 |
revised |
proving a simple function is bijective expanded the question to what it was originally supposed to be |
|
Nov 4 |
asked | proving a simple function is bijective |
|
Nov 3 |
accepted | Using the AM-GM inequality on 2 elements to deduce it's true for 4? |
|
Nov 3 |
comment |
Using the AM-GM inequality on 2 elements to deduce it's true for 4? Got it, thanks... |
|
Nov 3 |
asked | Using the AM-GM inequality on 2 elements to deduce it's true for 4? |
|
Nov 2 |
awarded | Editor |
|
Nov 2 |
awarded | Supporter |
