







World Finals 2010 Dairy - the road to Harbin & day 1
6 comments Posted by mRefaat at Tuesday, February 02, 2010My Mother & sisters & family they really are the reason for this win .. for their support and praying for me
Labels: ACM
SA,
it's my first time to write a technical topic on the blog, as i wanted this blog to be my personal not technical pages .. discuss my life and my opinions
But ....
5 days ago. in my ACM training Eng. M.M.A.Wahab told me that:
"There are the same number of rational numbers as natural numbers" (how .. rational are more??)
"There are the same number of Integer numbers as natural numbers" (Are you kidding me ?)
i didn't believe he tried to convene me, But i didn't...
After i went back to home, i started to Google that.. and i opened the discrete mathematics book to check that.
so i managed to proof that here.
1- Function:
In mathematics F(X) said to be a function where for every X in it's domain it produce a value on corresponding co-domain
2- Injective function:
In mathematics injective function is a function which associates distinct arguments with distinct values; that is, every unique argument produces a unique result (wikipedia)
3- Surjective function:
In mathematics, a function f is said to be surjective, if its values span its whole co-domain; that is, for every y in the co-domain there is at least one x in the domain such that f(x) = y (wikipedia)
4- Bijective function:
In mathematics, a bijective function is a function f from a set X to a set Y with the property that, for every y in Y there is exactly one x in X such that f(x) = y.
Alternatively, f is bijective if it is injective & surjective (wikipedia)
1- "There are the same number of rational numbers as natural numbers"
Assume Q is rational numbers, N is natural number
we must exhibit a one-to-one relationship"bijection" between Q & N
we will write Q as :
1st row denominator 1, 2nd row denominator 2 .. etc.
we can see that as a rectangular array that contain all rational numbers .. But there are some repetitions like 1/1 & 2/2 ....
Now we will try to map every rational number to a natural number (counting)
0 associate it with 0
then
1/2 associate it with 1
then
-1/1 associate it with 2
... etc.(neglect repeated values)
using this method we can give every rational number a natural number..
and the correspondence will be like that :
and that matching will cover all of Q and all of natural numbers.
Is this relation Injective ??
yes it's injective as for every number in natural numbers there exists only one value of rational number it could match
Is this relation Surjective ??
yes, as there is no value in the co-domain rational number that can't be mapped to one natural number
So this relation is bijective --> then the cardinality of the domain = the cardinality of co-domain
|Q| = |N| #R.T.P
Let us define functions :
a- abs(X) = X if(X>=0)
abs(X) = -1*X if(X<0)
b- sign(X) = 1 if(x>0)
sign(X) = 0 if(X<=0)
F(0) = 0, F(1) = 1, F(-1) = 2, F(2) = 3 ....
- This function is Injective where every element in Co-domain(Natural Numbers) there exists only 1 Integer number it could match
- This function is Surjective where every element in Co-domain is covered using a corresponding value in domain
So this function is bijection "Cardinality of Co-domain = Cardinality of Domain"
then
|Integer Numbers| = |Natural Numbers| ..... #R.T.P
DONE :D
what a mess ?? How can the cardinality of Integer Numbers = Cardinality of Natural Numbers
are Negative Numbers don't exist :S
But ... these proofs are right and you can find it on discrete and mathematics book when you search about countable sets & Contar's thearom
But i think that's all because INFINITY is not defined.. if infinity was defined all these theorem and proofs will be wrong...
Labels: ACM, Math, monw3at :D
Hello,
long time no see,
you know it's midyear vacation.
PS: "it's called midyear vacation, But it wasn't my midyear vacation as i had many many many things to do and I'm going to talk about that on a later post isAllah"
so, lets start this topic :
A week ago, i was at my coach's home, we were talking about TopCoder forum topic called : "you know you are a TopCoder when .."
He actually was talking about a situation happens to us all (C++,JAVA programmers):
when we are chatting or writing statements any where "we terminate our statements with semicolon instead of dot"
The important things is, when i went home this night i open the TopCoder forum and start looking for this topic, then i found it start reading it.
i liked this topic very much it's amazing really, this topic had started from 2003 and still active till now.
I book marked it and every day i check it and read few pages.
here are some quotes i find in this topic and liked them very much:
You Know You are a TopCoder when :
... When you see a sunrise and think "a flood-fill algorithm would have done that quicker";
... When you include your TopCoder rating changes in your weekly progress reports to you manager;
... When you think red > yellow > blue > green > gray, and orange is a special color;
... When you believe that "TopCoder - The Movie" would be a major box office success;
... When you start signing your emails with TopCoder Handle only;
... After paste your info into any web form you look for button "Compile";
... Instead of asking for directions, you just DFS;
... When you go out the balcony and see only red in front of your eyes;
... When part of your "life plan" is to improve your "color";
... When you are constantly removing the final t when typing in;
... When you carry a TopCoder code template in your wallet;
... When your friends call you by your TopCoder handle and not by your name;
... When the first thing your mother asks on a visit is if your rating is okay;
... When you declare variables during your math classes;
... When you believe "all time" started with SRM1;
see you next post,
mRefaat
Labels: ACM







.jpg)
.jpg)
.jpg)
.jpg)
.jpg)
.jpg)
