Of all the stupidest times to be affected.
I have decided not to be affected by family nonsense anymore.
Some things are obviously not my problem. Obviously not my responsibility.
Shell time.
Shields up.
Sunday, 30 November 2008
Monday, 24 November 2008
Exam timetable
25/11/08 PM - Fundamentals of Mathematics
26/11/08 PM - Coding Theory
28/11/08 AM - Introduction to Geometry
01/12/08 AM - Modern Optics
02/12/08 AM - Mathematical Methods in Physics II
Here we go....
26/11/08 PM - Coding Theory
28/11/08 AM - Introduction to Geometry
01/12/08 AM - Modern Optics
02/12/08 AM - Mathematical Methods in Physics II
Here we go....
Friday, 21 November 2008
need to live it.
Oh God let me live up to whatever You call me to do.
Let me cling on to the substance of things hoped for, to contain the evidence of things unseen..
Force me to..
onward.
Let me cling on to the substance of things hoped for, to contain the evidence of things unseen..
Force me to..
onward.
Saturday, 15 November 2008
Mathematical lovin'
Today is the day when I am going to proudly announce that I am doing a second major in maths. Attached below is an email sent out by my math tutor for one of my mods.. He's a grad student and the gst below are his initials. Of course, its fictitious, but he wrote it to help our revision???
Hi Jing,
It has been one year since you left me. You really taught me not to take things for granted, I should have proven my love to you earlier. I always take that the fact that I love you is an axiom and you knew it, no proof required but I guess I am wrong.
I am still trying to prove that if i m gst, then i love you.
I realized that a direct proof is quite hard.
so i tried to use a contrapositive to prove it:
I rephrase the sentence to
"if i don't love you, then I am not gst"
I also try to prove by using contradiction
i try to assume that "if i m gst and i don't love you", then something is wrong.
I also try to prove by cases,
Case 1: Assume that I m on earth, ....
Case 2: Assume that i m on mars,...
Case 3: Assume that i m on pluto ... and so on
It really seems that it is very hard to prove it.
I started looking for evidence that I have put in some effort, to prove that I just remember that I gave u special gift with ur name on it on V day every year since i met you. This is enough to prove that I have put in the effort as to show existence of effort, I just need to show examples. Of course, to show that it exists, I don't really have to construct it explicitly. but oh well, since I have some evidence, why not? you told me that it is not enough to show that i have dedicated my whole heart to u though, as i did not attended your 21st Birthday, you claimed that that is a counter example. If I can travel back time, I would try harder to get to you in time. But unfortunately, the hypothesis seems to be false, I can't travel back to the time, since the hypothesis is wrong, it doesn't matter about the conclusion... But anyway, regardless of what happened in the past, it is over now, but i do keep them in memory, as they deserve to stay in my brain, and not on a piece of helpsheet.
I should have go after you like the way I chase element in mathematics to show that a set belongs to another. I could have proven that the set of days that I like you is non-empty by assuming that it is empty and find a contradiction. I should have form Cartesian products of the flowers that i can find in the flower shop and give a bouquet to you. For example, let say we have A={red rose} in one shop, B={blue rose} in another shop, I would have given you AxB={(red rose, blue rose)} to you, I might also like to switch the order too. too bad I was just a poor student back then and I can't afford them.
I like you the very first day I met you, I just need to prove that if I like you on the k-th day, then I will like you on (k+1)-th day. This is the simplest mathematical induction procedure, perhaps it is not that simple to prove it that way. Perhaps proving that if i love you on (k-1)-th day, and k-th day then I will like you on (k+1)-day, for this problem, since I am taking two days backward, I will have to prepare two base cases, like you on first day and second day. Perhaps all these are not enough, perhaps I need to assume that i love you from the day I met you till k-th day and prove that i will love you on the (k+1)-th day. Any method will work to prove that I love you for everyday in my lifetime.
Consider the mapping "is the boyfriend of" from the set of "male" to the set of "female". Since the day u left me, the mapping is no longer a function, as I being in the domain doesn't have a gf anymore. so let's restrict the domain to the set of attached guys and make it a function. There are popular girls which attract a lot of attention and the function might not be injection (why?), by at the same time, there might be girl who are unattached yet which cause it to not be a surjection (why?). You asked me to try those, to try to include me inside the domain and you describe dream of the world that it is a bijection between the two sets so that every human have a soul mate dedicated to them. I sure hope that I am your preimage and I exist and unqiue. If it is a bijection, I hope that the inverse function which exist would map you to me.
You rejected me because you believe that we are lacked of common interest, the way you phrase it is our greatest common divisor is 1 and that's it. But I believe that starting from there, we can prove that we are linked by some integer x and y such that (gst)x+(Jing)y=1 and the condition is equivalent, the condition is so pretty that the converse holds as well. But of course, if possible, we can have more common interest and make things more interesting at the expense that sometimes (gst)x+(jing)y=something else, we cannot say that something else is our greatest common divisor, we can only say that it is multiple of our common interest. Perhaps sometimes we can find out how many common interests we have by using some formula like d(n) and knows it properties well so that we can find the nature of our intests easily. Anyway, at the minimum, we should know well about our gcd, just like if gcd(shangtai,jing)=d, then we should know that d|shangtai and d|jing and furthermore, for any integers, x and y, d|shangtai(x)+jing(y). However, if d|(shangtai)(jing), I can't say that d|shangtai or d|jing though, I need to check that d is a prime before I can do that by applying Euclid's lemma.
I sure hope that something remains in our memory and heart forever, afterall, we have spend a lot of time proving property of remainders. we should at the minimum, know our modulo arithmetic well like how do we subtract, add and multiply and replace equivalence stuff. (forget about divide or taking root as I don't believe that it is legal to divide our love). Unfortunately, you took mod of a prime number, say you took mod 7. and you prove that regardless of whether you are 1,2,3,4,5,6, you can some sort of do some trick to make yourself multiply to a number to form 1 and make you disappear from my vision. For example if you are the number 2, you can multiply yourselve by -3 to form -6 which is congruent to 1 and so on. How I wish you are number 0, then no matter what number is multiplied to you, you will always remain the same.
You called me up last week and ask me how many people should you invite to attend your wedding dinner, given the budget and the cost of vegetarian and non-vegatarian meals. The question sounds familiar, just like that question that we solved together back then. I think we can form diophantine equations and solve it. To solve it, we have a standard formula, but we have to find a particular solution first. we can do so by using Euclidean Algorithm.... I believe you can solve it. =) Congratulations to you. Hope you have a happily ever after life with ur hubby.
Last but not least, I still believe in my axiom.
Your Best Friend from now on (at least I define it to be),
shangtai
WHAHAHAHAHAHAA
Hi Jing,
It has been one year since you left me. You really taught me not to take things for granted, I should have proven my love to you earlier. I always take that the fact that I love you is an axiom and you knew it, no proof required but I guess I am wrong.
I am still trying to prove that if i m gst, then i love you.
I realized that a direct proof is quite hard.
so i tried to use a contrapositive to prove it:
I rephrase the sentence to
"if i don't love you, then I am not gst"
I also try to prove by using contradiction
i try to assume that "if i m gst and i don't love you", then something is wrong.
I also try to prove by cases,
Case 1: Assume that I m on earth, ....
Case 2: Assume that i m on mars,...
Case 3: Assume that i m on pluto ... and so on
It really seems that it is very hard to prove it.
I started looking for evidence that I have put in some effort, to prove that I just remember that I gave u special gift with ur name on it on V day every year since i met you. This is enough to prove that I have put in the effort as to show existence of effort, I just need to show examples. Of course, to show that it exists, I don't really have to construct it explicitly. but oh well, since I have some evidence, why not? you told me that it is not enough to show that i have dedicated my whole heart to u though, as i did not attended your 21st Birthday, you claimed that that is a counter example. If I can travel back time, I would try harder to get to you in time. But unfortunately, the hypothesis seems to be false, I can't travel back to the time, since the hypothesis is wrong, it doesn't matter about the conclusion... But anyway, regardless of what happened in the past, it is over now, but i do keep them in memory, as they deserve to stay in my brain, and not on a piece of helpsheet.
I should have go after you like the way I chase element in mathematics to show that a set belongs to another. I could have proven that the set of days that I like you is non-empty by assuming that it is empty and find a contradiction. I should have form Cartesian products of the flowers that i can find in the flower shop and give a bouquet to you. For example, let say we have A={red rose} in one shop, B={blue rose} in another shop, I would have given you AxB={(red rose, blue rose)} to you, I might also like to switch the order too. too bad I was just a poor student back then and I can't afford them.
I like you the very first day I met you, I just need to prove that if I like you on the k-th day, then I will like you on (k+1)-th day. This is the simplest mathematical induction procedure, perhaps it is not that simple to prove it that way. Perhaps proving that if i love you on (k-1)-th day, and k-th day then I will like you on (k+1)-day, for this problem, since I am taking two days backward, I will have to prepare two base cases, like you on first day and second day. Perhaps all these are not enough, perhaps I need to assume that i love you from the day I met you till k-th day and prove that i will love you on the (k+1)-th day. Any method will work to prove that I love you for everyday in my lifetime.
Consider the mapping "is the boyfriend of" from the set of "male" to the set of "female". Since the day u left me, the mapping is no longer a function, as I being in the domain doesn't have a gf anymore. so let's restrict the domain to the set of attached guys and make it a function. There are popular girls which attract a lot of attention and the function might not be injection (why?), by at the same time, there might be girl who are unattached yet which cause it to not be a surjection (why?). You asked me to try those, to try to include me inside the domain and you describe dream of the world that it is a bijection between the two sets so that every human have a soul mate dedicated to them. I sure hope that I am your preimage and I exist and unqiue. If it is a bijection, I hope that the inverse function which exist would map you to me.
You rejected me because you believe that we are lacked of common interest, the way you phrase it is our greatest common divisor is 1 and that's it. But I believe that starting from there, we can prove that we are linked by some integer x and y such that (gst)x+(Jing)y=1 and the condition is equivalent, the condition is so pretty that the converse holds as well. But of course, if possible, we can have more common interest and make things more interesting at the expense that sometimes (gst)x+(jing)y=something else, we cannot say that something else is our greatest common divisor, we can only say that it is multiple of our common interest. Perhaps sometimes we can find out how many common interests we have by using some formula like d(n) and knows it properties well so that we can find the nature of our intests easily. Anyway, at the minimum, we should know well about our gcd, just like if gcd(shangtai,jing)=d, then we should know that d|shangtai and d|jing and furthermore, for any integers, x and y, d|shangtai(x)+jing(y). However, if d|(shangtai)(jing), I can't say that d|shangtai or d|jing though, I need to check that d is a prime before I can do that by applying Euclid's lemma.
I sure hope that something remains in our memory and heart forever, afterall, we have spend a lot of time proving property of remainders. we should at the minimum, know our modulo arithmetic well like how do we subtract, add and multiply and replace equivalence stuff. (forget about divide or taking root as I don't believe that it is legal to divide our love). Unfortunately, you took mod of a prime number, say you took mod 7. and you prove that regardless of whether you are 1,2,3,4,5,6, you can some sort of do some trick to make yourself multiply to a number to form 1 and make you disappear from my vision. For example if you are the number 2, you can multiply yourselve by -3 to form -6 which is congruent to 1 and so on. How I wish you are number 0, then no matter what number is multiplied to you, you will always remain the same.
You called me up last week and ask me how many people should you invite to attend your wedding dinner, given the budget and the cost of vegetarian and non-vegatarian meals. The question sounds familiar, just like that question that we solved together back then. I think we can form diophantine equations and solve it. To solve it, we have a standard formula, but we have to find a particular solution first. we can do so by using Euclidean Algorithm.... I believe you can solve it. =) Congratulations to you. Hope you have a happily ever after life with ur hubby.
Last but not least, I still believe in my axiom.
Your Best Friend from now on (at least I define it to be),
shangtai
WHAHAHAHAHAHAA
Thursday, 13 November 2008
You just have to roll with it
So i bring all my gear into the science library only to see that there's no internet access from 7-10pm tonight for 'urgent maintenance work'
What the... Routers don't break down just like that, and saturday is OBVIOUSLY a better time to do this kinda nonsense...
Administration.....
ARGH.
Time to download everything off the IVLE network so I can view all my files offline later...
What the... Routers don't break down just like that, and saturday is OBVIOUSLY a better time to do this kinda nonsense...
Administration.....
ARGH.
Time to download everything off the IVLE network so I can view all my files offline later...
Friday, 7 November 2008
Tuesday, 4 November 2008
Vulnerability
In my blogging, and actually in all human relationships, there is a very distinct straining at two opposite ends.
There is a need to reveal. There is a need to show who you really are, and an underlying need to be accepted.
There is also a need to hide. There are some things you don't think you wanna show. Some thoughts, some actions, some habits.
Balancing the two, is probably a delicate art for anyone less than perfect.
The end state is easy to see. If you do spend enough time working on moving ahead towards doing things God's way and living your life right, there will be very little need to hide.
Or rephrased, its easier to reveal and teach when you've aligned your heart and mind. Maybe in a brute force kinda way, its slightly more forgivable to be stubborn when you're stubbornly right..
Exciting!
Onward.
There is a need to reveal. There is a need to show who you really are, and an underlying need to be accepted.
There is also a need to hide. There are some things you don't think you wanna show. Some thoughts, some actions, some habits.
Balancing the two, is probably a delicate art for anyone less than perfect.
The end state is easy to see. If you do spend enough time working on moving ahead towards doing things God's way and living your life right, there will be very little need to hide.
Or rephrased, its easier to reveal and teach when you've aligned your heart and mind. Maybe in a brute force kinda way, its slightly more forgivable to be stubborn when you're stubbornly right..
Exciting!
Onward.
Subscribe to:
Posts (Atom)