| bio | website | |
|---|---|---|
| location | Macedonia | |
| age | ||
| visits | member for | 6 months |
| seen | 3 mins ago | |
| stats | profile views | 48 |
I have experience in WinAPI, iOS and Android. I mostly work in and prefer to work in C++, Java and Objective-C.
I am familiar with: C#, SQL, Python, Javascript, PHP...
Check out (or don't) some of my tutorials and coding : www.youtube.com/user/13I21I34.
|
Jan 5 |
asked | Easiest way to prove that $2^{\aleph_0} = c$ |
|
Jan 4 |
awarded | Editor |
|
Jan 4 |
comment |
How to prove some properties of partitions of finite subsets of N? @gnometorule Yes, I made a mistake. I corrected it to provide a non-recursive definition for the progression. |
|
Jan 4 |
revised |
How to prove some properties of partitions of finite subsets of N? added 10 characters in body |
|
Jan 4 |
comment |
How to prove some properties of partitions of finite subsets of N? @Ilya I don't see what is your point, could you explain a bit more? |
|
Jan 4 |
comment |
How to prove some properties of partitions of finite subsets of N? @Amr That is not a counterexample. In the second set, 2, 5, 8 are elements of an arithmetic progression, and also 5, 6, 7, 8, 9 are elements of another arithmetic progression. |
|
Jan 4 |
asked | How to prove some properties of partitions of finite subsets of N? |
|
Nov 15 |
comment |
Four men seated in a boat puzzle Yes, that lends an idea of the process. Thanks again, it's all fine now. |
|
Nov 15 |
awarded | Scholar |
|
Nov 15 |
comment |
Four men seated in a boat puzzle Alright, that makes sense. Thanks. |
|
Nov 15 |
accepted | Four men seated in a boat puzzle |
|
Nov 15 |
comment |
Four men seated in a boat puzzle It would be most helpful if you could edit your post to contain that additional labeling of conditions and establishing those relationships as much as that could be done. If you could do that, than that would be the perfect solution to this question. |
|
Nov 15 |
comment |
Four men seated in a boat puzzle Good answer. I'm just interested if we could use some logic statements, or logic functions with predicates to mathematically write out all of this. Of course, we could write those requests for each man as logical functions using predicates and establish the conditions, but besides that, is there any way to elegantly and mathematically write out all that you said, and the fact that only "BACD" is the solution to the exercise? |
|
Nov 15 |
awarded | Student |
|
Nov 15 |
awarded | Supporter |
|
Nov 15 |
awarded | Analytical |
|
Nov 15 |
asked | Four men seated in a boat puzzle |

