An Enemy Rush

Thursday, September 25, 2008

      post #3541274482788155485

I had a stomachache this morning. Quite a bad one because I have never felt so pain in a long while. It was as though I have not eaten for 10 years. So I was tolerating the pain all the way until I reach the canteen, and after eating, I was feeling alright.

But that feeling was just temporary. 1 hour into the maths paper and I was feeling terrible. Yeah I needed to go to the toilet, but not in the middle of exams right? Otherwise there will not be enough time to finish the paper. So perhaps I will just hold for another 120 minutes.

But after around 30 minutes of solving problems and holding back shit, I could not take it any more. I rushed to the toilet while still thinking about the permutation question so that I save time.

When I came back out from the toilet, I met Lincon along the way. We had a brief conversation...

[Lincon]: Hey
[Me]: Sigh I have diarrhoea.
[Lincon]: ... oh shit!

Yeah, literally.

Labels: , ,

Friday, September 12, 2008

      post #7268623317705027620

Here are the answers to the previous post.

---

1) The answer is that switching will ensure a 2 in 3 chance of winning the grand prize. The key thing here is that the host KNOWS which door contains the grand prize, so whatever door he opens will definitely be the door with nothing behind. So you have 2/3 chance of choosing a wrong door initially. Of the remaining 2 doors, he will open the remaining wrong door, so switching will definitely get you the grand prize. However, in 1/3 of the cases, you may choose the correct door initially. The host can open either of the remaining doors, but it does not matter, if you switch, you are going to select the wrong door. So switching will fail you only 1/3 of the time.

If you are still not convinced, consider this variation: You have to choose 1 door out of 1000 doors, in which only 1 of the doors has the grand prize behind it. You select one, the host opens 998 other doors which do not have the prize behind them. So you are left with your own door and another door which he did not open. Are you going to switch?


2) The chances of the other being a boy too is 1/3. Consider her having 2 kids, so 25% of the time she will have 2 girls, 25% 2 boys, and 50% 1 girl 1 boy (GG, GB, BG, BB). We discard GG because we know that at least one of them is a boy. As for the other 3 cases which have equal probability of happening (GB, BG, BB), only 1 of the cases means that the other child is a boy too.


3) This one is easy. You know that there are 2 kids, an older and a younger one. The gender of the younger one is not influenced by the gender of the older one. So the answer is 50%.


4) This is my favourite. The answer to part a is 1:1 ratio of boys to girls. Subsequently, the answer to part b is also 1:1. This is due to the fact that a woman gives birth to a boy 50% of the time (and a girl 50% of the time too)

You can consider this ratio because you only determine the number of children in that household. There can be one boy only, or there can be 100 girls with 1 boy. You are not changing the gender of any children, nor are you killing boys. If the question were to be changed to: girls are killed 50% of the time... then of course the answer will be different because you already determined that some girls will be killed (and not boys). But this is homicide so maybe not a good example, but the idea is there.

If you are still not convinced, consider an infinite number of children standing in a row. A household will pick children first in the row until it reaches a boy, in which it will accept. The next household will pick children after that doing the same thing. Of course some households will end up with 1 boy only, with no girls. The boy:girl ratio is hence 1:1.

Labels: ,

Saturday, September 06, 2008

      post #7264156857068067159

Some probability problems to think about.

1) Suppose you are on a game show. There are 3 doors, one of them revealing a car behind it, or 1 million dollars, or anything you like. The other two have nothing behind them. You can only pick a door. So you pick a door, let's say door A. The host, who knows which door has the grand prize and which doors do not, then open one of the other 2 doors, either B or C, which has nothing. He will always open a door which has nothing behind it. So the question is, should you stick with your original choice, or should you switch, or it does not really matter? What are the chances of you winning the grand prize if you do not switch? Could it be 1 in 3, because your original choice was a 1 in 3 chance so whatever the host does, does not make a difference, or could it be 1 in 2, because now you have 2 choices, either your original door or the door that is left?

2) Suppose you know this woman who has exactly two children, but you do not know their genders. You ask, "Is one of them a boy?" She replies, yes. What are the chances of the other child being a boy too? Suppose that a woman gives birth to a son 50% of the time and a daughter 50% of the time.

3) Suppose you know another woman who also has exactly two children. You do not know the gender of the younger one, but you know that the older child is a boy. What are the chances of the younger child being a boy too?

4a) Suppose in this country, there is a strange rule. women are to give birth, and they have to give birth until 1 and only 1 boy is born. This means that if a woman gives birth to a daughter, she will have to continue giving birth until she gives birth to a son, then she stops. Or if her first child is a boy, she stops giving birth. Suppose that a woman gives birth to a son 50% of the time and a daughter 50% of the time, what is the ratio of the number of boys to the number of girls after all the families have 1 son each? Do not factor in the number of men and women, only count the offsprings.

4b) The offspings grow up and get married, and they follow the same rule in the country. Then the new generation does the same. After many generations, what is the theoretical male to female ratio?

---

If you have not tried those problems, please give yourself at least 5 minutes thinking through each problem. They are mathematical problems, there are no tricks involving words so pardon me for any bad english if any.

---

(Answers coming out soon)

Labels: ,

Friday, April 04, 2008

      post #640006792973212598

On Tuesday there was Chemistry Practical. Miss Lee was not around so another teacher came to take over the session. At the end of the session I was having fun with the bench reagents. I was mixing sulphuric acid with sodium carbonate solution and watching effervescence of colourless gas. And I didn't know when you add sulphuric acid to potassium permanganate solution, you get the following:

It's actually very beautiful. The two solutions seem to be immiscible because even when you shake the test tube, the purple potassium permanganate solution just stay at the bottom nicely. The teacher at the background was the relief teacher. She told me off twice for mixing the chemicals. Our class finished the practical early, and the next lesson was actually chemical tutorial in that same laboratory (but different teachers). She actually wanted to leave early at first but changed her mind later because she "had better stay to make sure that boy does not play with chemicals".

The performance theatre is a good place to sleep. On Tuesday the whole year 1s went there for Civics Tutorial session. They talked about leadership in VJC. There were 8 to 9 year 2s talking to us about their experiences, and I fell asleep while the 5th one was speaking. Hey at least I persevered for the first 4 leaders before falling asleep. There was also Chemistry lecture there on Wednesday instead of LT5 for some reason. It was super nice to sleep. The air-con was just right, the seats were comfortable, the lecturer was boring. Those were the conditions to induce drowsiness. Maybe the lecturer was not boring, but she speaks in one pitch (quite high pitch) so that's more than enough to knock me out. At the end of the lecture, she commented that we were very well-behaved and should deserve a round of applause. Guys, we can all keep up the good work! You should encourage others to sleep as well!

Thursday was awesome. I skipped Geography lecture because I did not have the powerpoint slides. But that's not the main reason. I stayed in the computer lab to finish my Preliminary Ideas for Project Work, which was actually due on Tuesday. I only started working on it on Wednesday night so it was kind of a rushed job. I just got it back today and Miss Ng (my Supervising Tutor) wrote many comments on it. Oh btw I think Miss Ng is a very hardworking teacher because she writes many comments. In our Physics tutorials and laboratory reports, she will write down many things that she thinks we can improve on. This is what I believe a good teacher should do because if we don't know our own mistakes in the first place, we will hardly improve.

I passed the Physics Olympiad selection test. I don't know how I did it, maybe my luck was good at that time, or the calculator's random function worked marvellously (all the questions were MCQ). But the trainings are on Mondays which clash with Maths Olympiad trainings (which I have already pushed) and choir practices. I know next Monday there will be a Singapore Maths Olympiad selection test (which I hope to pass so that the school can sponsor me for the SMO competition). As for the following Monday, I have still yet to decide whether to go for Physics training or choir practices. Maybe I will go for an hour of Physics, then take a short break before attending choir practices.

Talking about Maths Olympiad, my Saturday trainings will end after 2 more sessions, with the last one being on the 12th of April! That means I can finally go for morning choir practices which I have never ever gone since I got into VJC. Oh they gave us this "take home test" last Saturday to test our ability to solve questions without the constraints of time. They told us to hand in on the 12th. There are 10 questions, and I spent 5 hours working on them. Managed to successfully solved 3 of them, then I laughed at myself because my solutions are actually very easy. I don't know why I spent so long on them. I wrote on no more than 1 side of the college foolscap per question I solved. Going at this rate, I don't think I can finish the test.

I think some of our class tutors are quite pissed at our class. Or I should say that they are starting to have a bad impression of our class s41. Our GP teacher Mrs Ch'ng was quite carefree because nobody commented when she asked us a question during GP. She went, "Oh, so nobody wants to say anything? Let's move on..." She sent a few people out of the class on Thursday by the way.

"You didn't do my homework? Out!"

"Where's yours? Out!"

"Out!"

"You don't do my homework, you'll get out of the class."

Our Maths teacher Mrs Ang was feeling quite helpless because few people did the tutorials. "I know term 2 is a busy term... ... blah blah... ... Don't let your work snowball!" I love that phrase a lot, I don't know why. She was very funny during AP-GP lecture. She greeted the lecture hall (but didn't really expect us to greet her back):

[Mrs Ang] Good afternoon.
[Students] Good afternoon Miss... ...
[Mrs Ang] (suddenly very agitated, pointing to herself fiercely) MRS ANG! I am Mrs Ang.

Reminds me of Miss Lee, our Chemistry practical teacher. "I am Miss Lee, not Mrs. Miss!" Why is she so proud being single? For those who don't know who she is, she is the lecturer for the Atoms, Moles and Stoichiometry, so let's call her the Mole teacher (pun intended). It's just diagonally below her nose by the way.

Labels: ,

Thursday, March 27, 2008

      post #9075523357906336613

Just finished NDP recording. The recording was yesterday from 2pm to 9.30pm and today from 2pm to 6.30pm and we had to record 5 NDP songs which will be broadcasted on National Day itself. It's not like we will get to perform, nor will we get free tickets.

I missed the recording. It was definitely more fun than the VSchoir's recording of Go Forth with Pride and Keeping the Dream Alive, even though it was more tiring. I guess it's the environment, because the studio is rather big, and we had 1 or 2 microphones per section. We could actually hear what the girls were gossiping because the microphones were very sensitive. It was fun laughing at Abel's early entry, Reuben's and Wayne's crack and Mr Chua's workout. I think we did a very good job... we worked very efficiently and completed the 5 songs on time. Well done!

It feels sad to think that the recording is over and we won't be doing such recordings in the near future. But I know I should not feel sad because now I have happy memories, and it beats having no memories at all.

I dunno why but in every alternate post, I must complain about my studies. I lack the time and motivation to do my tutorials and read through lecture notes. I really need to do a lot of catching up. I don't have time during the weekdays. Mondays and Wednesdays are choir practice days. Schools ends very late on Tuesdays and Fridays, and I will somehow be busy on Thursdays. But when weekends arrive, I will declare myself a holiday and slack the whole time. That's why I will never get my work done.

Not say very happy with my Maths common test, because I don't think I did my best. I lost to all the VS 4A people in my class haha, that means to say, Jun Yuan and Ryan. Both of them score 49/50. And my first GP essay isn't very good too, scored an E grade. It sounds very lousy right? In secondary school it's equivalent to a C6. E sounds like you fail terribly. And there's GP test tomorrow. I don't really intend to study. I think I'll just go and screw up the paper.

Saturday is coming. Every saturday I always wonder whether I should go for choir practice or Maths Olympiad training at NUS. It's a rare opportunity to be selected to attend such trainings. I am also using that excuse for not attending VJC's own maths trainings because the latter clash with choir practices on Mondays. I know I am already being excused from Saturday morning choir practices, but it sucks not going for every choir practice since the start of the year. Yeah so far I have skipped every single morning choir practice. NUS is so far away, and the time needed to travel is around 2 hours. Sometimes the lessons are not really worth it, like the 2 combinatorics lessons because the lecturer (Mdm Teo's husband) didn't teach much and just spent time talking to us about other stuffs. I saw some combinatorics notes on his table which was for class in term 3 I think, and couldn't stand not learning anything from there, I took pictures of the notes and read it on my way back to school. I saw a lot of stuffs which I have never thought before, such as:

Question
Express in terms of n: 1(nC1) + 2(nC2) + ... + n(nCn), whereby nCr = n!/[r!(n-r)!]

Solution
Consider (1+x)n = 1 + (nC1)x + (nC2)x2 + (nC3)x3 + ... + (nCn)xn.

Differentiate w.r.t x: n(1+x)n-1 = 1(nC1) + 2(nC2)x + 3(nC3)x2 + ... + n(nCn)xn-1

Substitute x = 1 and we will get our answer of n(2n-1).

I don't think I want to learn those stuffs which have already been taught in secondary school. Total waste of my time. I should have gone for choir practices then. But last Saturday's lesson was interesting. It talked about the imaginary unit i which is the sqaure root of -1, something which I have always been interested in. So I don't really know if the next lesson will be worth going or not. And if I can't make up my mind, I guess I will just go for the NUS training because that is my routine.

Ahh, just 3 more weeks and it's over. I can't wait to go for Saturday morning practice.

Labels: , ,

Sunday, October 28, 2007

      post #8893153526920671400

Question: Prove that there are no positive integers x and y, such that 2(x² + xy + y²) is a perfect square.

Solution: Assume that there is some k² = 2(x² + xy + y²); where x, y and k are positive integers.

LHS = RHS --> Even number
So k² is divisible by 2.
If k is an odd number, then k² is an odd number.
So k is not an odd number.
So k is an even number

k² is divisible by 4.
k²/2 is an even number.

k²/2 = x² + xy + y²
So x and y are both even numbers (because if either is an odd number, LHS = odd number)

If such a positive solution exists, then there must be a value whereby k² is minimum. Let k² = 2(x² + xy + y²) be such a value.

Since x, y and k are even numbers, let x = 2p; y = 2q and k = 2r whereby p, q and r are positive integers.

(2r)²/2 = (2p)² + (2p)(2q) + (2q)²
2r² = 4p² + 4pq + 4q²
r² = 2p² + 2pq + 2q²
r² = 2(p² + pq + q²)

But we have assumed that k² is the minimum.
r² = k²/4 is smaller than k² which results in a contradiction.

Hence there are no positive integers x and y, such that 2(x² + xy + y²) is a perfect square.


N.B.: If you have no clue what I just did, I proved the question by contradiction. I assumed the opposite and found out that the results contradict each other. I've shown that if there exist some positive integers x and y which satisfy the equation, then x/2 and y/2 must also satisfy it. By using the same method, I prove that x/4 and y/4 must also satisfy it, etc. Eventually I will end up to an odd number or a fraction which does not satisfy the equation. An elegant way of proving by contradiction!

Labels:

Sunday, July 08, 2007

      post #6762710502659449216

Last Saturday I went to NUS for SMO Senior Section special round. 3 hours to attempt 5 questions (no part a part b all those). Haha. Not bad eh.. in the end I only could do 2 questions.

Then yesterday I went to NUS again for SMO Open Section special round. This time, it was the same number of questions but 4½ to do! So it averages to 54 minutes a question. Haha. I also only knew how to do 2 questions, and spent around 2 hours on one question but in the end, I still didn't know how to do.

There were 2 questions which I did not attempt at all. One of them was:
Let a1, a2, ..., an be n real numbers whose squares sum to 1. Prove that for any integer k ≥ 2, there exists n integers x1, x2, ..., xn, each with absolute value ≤ k - 1 and not all 0, such that

Labels:

Thursday, June 21, 2007

      post #7088678864311025347

I have been sleeping at wee hours these few days, so it isn't really surprising that I am blogging at this time now.

Just received news from North that I got into Singapore Mathematical Olympiad Special Round for both Senior and Open sections. Well, for the Senior section it was kind of expected because I got into it last year as well, so this year should get in too since they are of the same standards. I hope to get at least 2 questions fully correct (the paper is 5 questions, 10 marks per question. I scored 18 last year, but I dunno how it was distributed).

For the Open section... hmmm, I think I am going there to submit blank paper. I tried looking at the past year paper and I can't do a shit. I don't even understand the solutions.

And North started off the conversation saying, "Get into the IMO Team!" Hmmm, IMO team is chosen by selecting the top 6 scorers for the Open Section, and includes all the JC people, lol.

Ah well, wish North good luck into getting into his country's IMO team?

Labels:

Wednesday, April 04, 2007

      post #3460969227302822697

April fools day just came and went. Nothing much happened to me and nothing much happened to other people who were tricked by me, mainly because what I did was quite unsuccessful. Never mind, I shall try again next year.

Today, Wei Liang, North, Akash, Tianyuan, Lin Han, Haochi, Zhongli and I went to VJC for their annual Maths competition. Last year Wei Liang, North and I went there too and we got Certificates of Participation. Haha. This year it was almost the same, just that we received an additional 30% discount voucher from Texas Instruments.

This year's competition was similar to last year's. First we took the preliminary round. 30 MCQ questions in 60 minutes. 5, 0 and 2 marks are awarded for each correct, wrong and no answer, respectively. So we actually start off with 60 marks and work our way up (or down!). There was really not enough time so I could answer like 12 to 15 questions only, not saying that most of them are correct anyway. North managed to answer more than half the questions, not bad.

Then after that we went on a tour around the school. I had toured before VJC so it was kinda sian. They made this tour for us so as to stall time for them to mark our papers. After that we went to the Performance Theatre for a talk about Texas Instruments (TI) Graphical Calculators, again to stall time for them to mark our papers. The talk was the same as last year's.

Anyway, they asked 2 volunteers on stage to demonstrate some device for tracking motion. There was one DHS plump nerd - as in totally nerd - who walked onto the stage clumsily and as he walked he tucked in the front of his shirt in front of everybody, and unfortunately leaving the back untucked. Then his movements are a bit 'spastic'. After cooperating with another guy they both hi-5 each other very hard (and note that it's the DHS guy who suggested it and clapped very hard), and both of them received a TI scientific calculator each. When I asked North why he didn't wanna volunteer to go, he said, "Never mind, we go for Graphical Calculators, not Scientific ones."

Well, we went back to one of the LTs for the final round. It was exactly the same as last year, they put the names of the schools in cardboard folded into a triangular prism. Anyway, DHS, RI, RGS and HCI got in the final round. And the nerd was actually one of those who got in, oh man. Shame on NUS High School for not being able to get in. I think more than 9 of those who got in (3 per school, so 12 altogether) are scholars.

The final round consisted of 4 sections: Individual, Team, Audience and Buzzer sections. For individual, each team member would answer 3 questions and other 2 team members are not allow to say anything or solve the question. So 9 questions in total. You can actually see the 3 China Scholars from RI having a very cool attitude. They spend only say, around 30 seconds per question when each is given 100 seconds and after writing their answers, all 3 of them will cross their hands and sit back and relax. Haha.

I could solve one of the questions correctly (so far that I can remember). It went something like this:
Given that [x] means the largest integer equal to or smaller than x, find the number of solutions of x for
[x/2] + [x/3] + [x/6] = x
for integer values of x ≤ 2007.

Answer is 334.
Notice that for x/2 + x/3 + x/6 = x, this statement is true for all real values of x, because:
x * (1/2 + 1/3 + 1/6) = x
x * 1 = x
x = x.

However, in order for [x/2] + [x/3] + [x/6] = x, x must be a multiple of 2, 3 and 6, otherwise the left hand side would be smaller than the right hand side.
LCM of 2, 3 and 6 is 6, so therefore number of integers satisfying that equation is 2007 / 6 = 334 values of x (all multiples of 6 from 6 to 2004).


Oh by the way one of the emcees said, "Other team members are not allowed to discuss." Then the DHS nerd shouted in the microphone with his high-pitched voice, "I never say anything!"

Yeah so RI won that round. After that was team round, whereby each team is given 7 questions to solve within 7 minutes and teams are allowed to discuss. Well just look at RI again, all 3 of them didn't even discuss the answers at all, they just did the questions.

After 420 seconds, the scripts are being marked so the audience round came. There are 10 questions in which questions 1, 4, and 7 are open to the audience sitting at the right block, 2, 5 and 8 in the centre block and 3, 6, 9 in the left block, and if no one answers within a certain time limit, the question is opened to all. The first person with the correct answer would win a TI Scientific Calculator each. And for question 10, it was opened to all and the winner could win a TI Graphical Calculator (which is more expensive).

There are quite a number of questions we can do (as in North, Wei Liang and I), but there are 2 questions I want to rant about.
Given that i2 = -1, find the value of
i + 2i2 + 3i3 + 4i4 + ... + 32i32, in terms of a + bi.

This question is actually quite easy, considering that i is my favourite number. So I went to do and found out that
i1 = i
i2 = -1
i3 = -i
i4 = 1
i5 = i
...

So hence for 'a', we just have to find those of even i powers. So we have:
2i2 + 4i4 + ... + 32i32
= -2 + 4 - 6 + 8 - 10 + ... + 32
= (-2 + 4) + (-6 + 8) + (-10 + 12) + ... + (-30 + 32)
= 2 + 2 + 2 + 2 + 2 + 2 + 2 + 2
= 16

For b, it's the same, and doing the same way, we will get the whole answer as 16 - 16i.

Due to unforgivable carelessness, I got an answer of 16 + 15i, which from another perspective, looks wrong because 15 seems a little bit odd. But nevertheless, I went to try and heard the female emcee said to the male emcee, "15i... ..." Argh.

Another question is:
Find the value of
(1 + tan13°)(1 + tan14°)(1 + tan15°)... ... (1 + tan32°)


Wei Liang and I looked at the question for a while, then suddenly both of us said, "hey!" Because earlier today I discussed with Wei Liang one Maths question from past year Maths Olympiad Paper: Find the value of (1 + tan40°)(1 + tan5°). The answer is 2, because using the identity tan(A+B) = (tanA + tanB)/(1 - tanAtanB), the answer come up to be 2. Therefore if A and B add up to 45 degrees, the answer would be 2.

So we started pairing up the factors together such that
(1 + tan13°)(1 + tan14°)(1 + tan15°)... ... (1 + tan32°)
= (1+tan13°)(1+tan32°) * (1+tan14°)(1+tan31°) * (1+tan15°)(1+tan30°) * ... * (1+tan22°)(1+tan23°)
= 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2
= 210
= 1024.

In fact, this morning, I borrowed Robin's A Maths textbook to study the trigonometry identities because my textbook don't have, and I thought one question would come out on that. In the end, none came out, maybe only this, which we already know so we just worked out.

Unfortunately, that question was for the audience in the left block, but no one managed to solve it so it was opened to everyone. Both Wei Liang and I raised up our hands and the emcees didn't see us, and chose somebody else from some other place. And thing is that foreign girl who answered got correct. Argh.

After that they went through the answers for the team round before moving on to the buzzer round. Anyway, this is how the conversation went:

[Emcee]: DHS, please press the buzzer and speak into the mic.
*beep*
[the same DHS Nerd as mentioned earlier]: Hello? Hello?

[Emcee]: HCI, please press the buzzer and speak into the mic.
*beep*
[HCI]: Mic test.

[Emcee]: RGS, please press the buzzer and speak into the mic.
*beep*
[RGS]: *thump thump* (because one of the girls was knocking the microphone)

[Emcee]: RI, please press the buzzer and speak into the mic.
*beep*
[RI]: Test.

Haha. Okay I want to end off this post already. So let's just put it that RI won with a very high score, followed up HCI and DHS won RGS by 2 points. Oh man. So wasted. I can't stand the DHS guy. RGS could have caught up and tied with DHS.

*Note: I am not prejudiced against DHS or something, and they aren't nerds. There was only 1 nerd that I saw, and it has been a long time since I have seen a nerd.

Before I end the post, let's dump in one more question that I saw from the Director's Challenge a few weeks ago.
Find a number such that when you move the first digit to the last place, the new number is 1.5 times the original number. (eg: if original number of 1234, new number is 2341; if original number is 123456, new number is 234561.)


The answer is zero. Really. Okay just kidding, let's be more mathematical here, shall we?

Let's have a 4 digit number abcd. After moving we will have bcda. So we have:
1.5 * (1000a + 100b + 10c + 1d) = 1000b + 100c + 10d + a
1500a + 150b + 15c + 1.5d = 1000b + 100c + 10d + a
1499a = 850b + 85c + 8.5d
14990a = 85(100b + 10c + d)
2998a = 17(100b + 10c + d)

Now we have a problem. 17 is a prime number, and 2998 is not divisible by 17. We notice that a cannot be zero, otherwise b = c = d = 0. In order for a, b, c and d to be integers, a must be a multiple of 17, which there are no solutions for a < 10. Hence there are no 4-digit numbers satisfying this question.

Let's try a 5 digit number abcde, and after moving we will have bcdea. So we have:
1.5 * (10000a + 1000b + 100c + 10d + e) = 10000b + 1000c + 100d + 10e + a
149990a = 85(1000b + 100c + 10d + e)
29998a = 17(1000b + 100c + 10d + e)

Note that 29998 is not a multiple of 17, so 5-digit numbers are out.

Using this method, we can find out that all 1-, 2- and 3-digit numbers are also out. And so we need to find a number which is divisible by 17.
For 6 digit numbers, we have 1499990 = 85 ... ...
For 7 digit numbers, we have 14999990 = 85 ... ...
We can ignore the 5 from 5 * 17 = 85 because anything ending with zero will be a multiple of 5. So keep trying by doing long division of 14999... by 17 while adding 9s at the back, and we notice that...
14,999,999,999,999,990 is divisible by 17 exactly!
So hence working backward, we have
1.5(1,000,000,000,000,000a + 100,000,000,000,000b + ... + 100n + 10o + 1p) = 1,000...b + ...

Meaning that abcdefghijklmnop * 1.5 = bcdefghijklmnopa, a sixteen digit number.
14,999,999,999,999,990a = 85(1,000,000,000,000,000b + ... + p)
176,470,588,235,294a = 1,000,000,000,000b + ... + p

If a = 1,
b=1, c=7, d=6, e=4, etc.

Hence, the smallest number satisfying the question is: 1,176,470,588,235,294.
Of course, the next number would be when a = 2.

By the way, during the final round, the slide shows a compass, with the directions N, E, S and W. So we were joking that N is North (duh!), S is me, Sherman, and W and Wei Liang. Poor Akash, his name is not in.

Labels:

Wednesday, March 21, 2007

      post #4755304317638357014

I lost my protractor some day during the holidays, so I went to the school bookstore to buy a new one. Unfortunately, all they have was protractors or set squares manufactured by Ahkan. I was warned by Mr Pang that Ahkan's protractors are not good because their accuracy is quite off. So in the end, I just bought one protractor yesterday at a shop below my house.

This morning I was looking at my protractor along with its plastic case, and I realised that there were some "matters needing attention" written at the back of the protractor casing. Lucky this was made in China, otherwise I wouldn't have known the meaning of those without the Chinese words. The picture to the left is the scanned picture of the cover.

Haha other people from my class were having quite a nice time laughing at the language. I think the company just went to some translator online and bluff their way through.

During recess I was quite sian, so I anyhow doodled on the whiteboard and eventually came to this (extended version):
To prove that graphs do not exist

Start off with integration...
∫(x2 + 4x + 3) dx
= ∫x2 dx + ∫4x dx + ∫3 dx
= (x3/3 + c) + (2x2 + c) + (3x + c), where c is the arbitrary constant[1]
= x3/3 - 2x2 + 3x + c + c + c -------- (1)
= x3/3 - 2x2 + 3x + c -------- (2) (because arbitrary constants do not add up)

Let's take (1) minus (2):
c + c + c - c = 0 (since they are equal)
2c = 0
c = 0

Now let's have a linear equation:
y = mx + c -------- (3)

and Einstein's famous formula[2]
e = mc2

Converted into:
m = e/c2 -------- (4)

Sub (4) into (3):
y = (e/c2)*x + c
y = ex/c2 + c3/c2
y = (ex + c3) / c2
yc2 = ex + c3

Because c = 0 as proven earlier,
0 = ex + 0
ex = 0
e = 0 or x = 0

Now we know e = 0 is not applicable because e = 2.718... [3]
Therefore, x = 0.

Sub x = 0 and c = 0 into (3):
y = 0 + 0
y = 0

Therefore, x = 0, y = 0 for any values of m, and for any given equations.

Epilogue: Because x = y = 0 for everything, graphs do not exist. If you start drawing a line on the graph paper, I would use THIS proof to tell you that you are doing the wrong thing. Perhaps the only thing you can mess with on the graph paper is drawing the axes and maybe drawing the origin only, since x = y = 0.


Oh by the way, I call this "rubbish", and when Mr Pang saw this on the whiteboard, he calls this "nonsense".

Labels: ,

Saturday, February 03, 2007

      post #3411377247294996908

Last Monday, the Maths Department, or maybe just Mr Alvin Lim himself, posed some Maths questions and we have to send our solutions to the school. The deadline is today at 12 noon. They claimed that prizes will be given to the best solutions from each level.

It was Wei Liang who made this announcement on stage, because he is the Maths Society chairman. He was very smart to make an announcement about Chinese Orchestra concert as well, which he told me later that it was quite impromptu.

Anyway, the 2 questions are:
1) The Lost World
In a Mathematics class,
70% of the pupils have lost their pen,
75% of them have lost their books,
80% of them have lost their calculators, and
85% of them have lost their rulers.

At least what % of the pupils have lost all 4 items?
[Picture of the Jurassic Park - The Lost World]


2) Bond Concert
The Bond Girls' concert starts in 16 minutes tonight. They need to cross an old bridge and can only have 1 torch with them. Only 2 Bond Girls can cross at one time and each time, one has to return with the torch to bring another acorss.
The time taken for each girl is as follows:

Haylie - 1 minute
Eos - 2 minutes
Tania - 4 minutes
Gay-Yee - 8 minutes

The time taken for 2 girls to cross the bridge is that of the slower one. Can all of them cross in 15 minutes?


I have the solutions myself already, but I am not posting them to the school. I am posting them here instead haha.

So for 1st question,
We have a certain percentage of students losing all 4 items, and we want to keep it to the very minimum. In order to do this, we must have as many people losing only 3 out of 4 items, while the rest losing all 4 items. So something like
+--------+--------------------+
| Lose 4 | Lose 3 items |
+--------+--------------------+

(Note that if it is possible for all students to lose 3 items, or if it is possible for some students to lose 3 items and the rest to lose 2 or less items, then the answer to the question is 0%)

Now to find as many people as possible to lose all 3 items is no mean feat. Simply change the statements to:
30% of the pupils did not lose their pen (item A),
25% of them did not lose their books (item B),
20% of them did not lose their calculators (item C), and
15% of them did not lose their rulers (item D).

So now we have to make sure that we have as many students NOT losing only 1 item, as possible. We can represent it by a model:
+----------+-------+--------+----------+-----------+
| Lost all | DNL D | DNL C | DNL B | DNL A |
+----------+-------+--------+----------+-----------+
15% 20% 25% 30%
*DNL = Did not lose


From there it is obvious that those students under "DNL D, DNL C, DNL B and DNL A" lose 3 out of the 4 items. And number of students who lost all 4 items is kept to a minimum (no matter how hard you try you always get the same number of students). Hence the percentage of students who lost all 4 items is 100% - 15% - 20% - 25% - 30% = 10%.

Many people got 45% for their answer because they used only the lowest 2, ie: 70% and 75%, and by using the same method, they found the answer of 45%. However, 80% and 85% of those who lost C and D respectively can also be part of those who did not lose all items, and hence those who lost all 4 items can be minimised further.

Well as for the 2nd question, through some thinking 2 solutions can be found:
4,8 -------- 1,2
4,8,1 ------ 2
1 ---------- 2,4,8
1,2 -------- 4,8
----------- 1,2,4,8

The 2nd solution is simply swopping Haylie and Eos (1 and 2 minutes respectively), which it will end up with 15 minutes too.

The solution lies with Haylie and Eos being the "transporters" of the torch. Being the fastest 2 people, both of them are the ones to bring the torch back and forth. Of course, the first step is to bring both of them across so that there is someone at the other end to return the torch after Tania and Gay-Yee (4 and 8 minutes respectively) have crossed.



There is one more question for staff too, which Mr Lim said that there IS a pattern.
A, B, H, F, M, C, I, G, T, D, O, J, U, E, X, _?

I still have not solved this question so maybe going to figure out. Tried converting all to numbers, which did not show any pattern at all. Noticed that all the letters are being used only once, and the remaining letters are: K, L, N, P, Q, R, S, V, W, Y, Z. One lame solution brought up was that the answer is A, because the pattern repeats itself after the X.

Labels:

Monday, November 06, 2006

      post #884255234684816860

Woo! Finally finished my Maths homework. Both E and A Maths! Combining both Maths together, I've used up 36 pieces of foolscap papers and 12 graph papers. What a waste man. Future generations would probably be doing all their homework on the computer. Haha.

I think I am quite slow, spending more than 1 week of the holidays to do both Maths. Deducting all the days where I am not in Singapore, and those days where I have choir practices, I think I have less than 3 more weeks to do homework. And to think that Maths, being the subject that I can do more productively, took me more than 1 week to do. Still left with the 3 Sciences, Geography AND SS, and the Chinese story book thing which I haven't even touched.

Talking about that, they seem to change the assignment now. Haha. Last time, it was plain boring, writing a few hundred characters on "Summary of contents" and few hundred characters on "Thoughts". Now it's more interactive, it seems. Haha. Okay I haven't really understood my assignment yet. I think I shall read that again next time.

The next assignments that I would probably (try to) do will be Physics and Chemistry, before moving on Languages and Humanities.

Anyway, to say, I haven't really finished my Maths. I left around 2 questions which I am stuck at. One of them is probably not taught yet, so I shall not attempt it. Another one is on Permutation and Combination. Have a go at it:
A garden centre sells 10 different varieties of rose bush. A gardener wishes to buy 6 rose bushes, all of different varieties. Of the 10 varieties, 3 are pink, 5 are red, and 2 are yellow. Calculate the number of ways in which her selection of 6 rose bushes contain at least 1 rose bush of each colour.

~ A-Maths Ten-Years' Series Pg 65 Qn 7 (iii).

Answer is at the back of the book but I dunno how to arrive at that answer, or maybe I know but I am not convinced.

Any solutions anyone? Please post as comments.

Labels: ,