Search results

hell yeah recorder buddies play hot cross buns and merrily we roll along (o'er the deep blue sea) gr8 stuff

Aha, that kinda makes sense.

I don't... understand. So we factorise it to get q(n) = n(11n+32) n = 1, or 11n+32 = 1 - I get because if q(n) is prime, one of the factors has to be 1. But I still don't get why we consider the case n = -1 and 11n+32 = -1. (but it's getting late so... my brain might be failing again)

But why the case for -1?

Re: The Official Football Thread You know it's that bad for the other team when Torres scores.

story of my stats mid sem *sigh* Was one of the last classes to do it, but geez - those questions. You could get them beforehand and still fail.

Sophie's World... by Jostein Gaarder?

Frankly, by now you should've already had 8000 words and you're just editing. I went to an EX2 day at Wenona and they recommended 50% of the time you should be writing, and the other 50% you should be editing. Now for me, I finished my first 8000 words back in late January of the year I did my...

As You Like It is... alright. I wouldn't call it the worst though. Some parts were good.

Free bump. If he is who I think he is... he's very good at mathematics. EDIT: Okay since I know it's him now, yes - this guy is quite dedicated, I remember last year I was sitting in a maths lecture with him and he was writing down some integrals, and I'm like "Umm... this is algebra" and he's...

If you watch Glee, this character:

I'd say put your tutes near the end of the week so you can ask people in other tutes how it is, and adjust your study accordingly.

Maybe because they hope for some sort of splash effect from the older person's apparent "maturity".

But if 11n + 32 = 1, then n = -31/11, which isn't an integer input. In fact, if 11n + 32 = -1, we get n = -3,, which is the other solution to q(n) being prime. So my question then is, why are we testing if 11n + 32 = -1 and if n = -1. I could just say it works because "it works", but... why?

May I suggest random Wikipedia article reading? Read up on a few faiths... short list 'em.

I think he meant he made two big mistakes when he submitted.

Why you need to do it? Well, cos(x)^6 and sin(x)^5 can't be easily solved directly. So you use a reduction formula to reduce the powers so in the end you just have to integrate a sin or a cos or something easy like that.

The solutions are n = 1 and n = -3, yes. But the question is "Why is q(n) prime for only two values of n, and composite for all others?" I know it has something to do with the factorisation being n and 11n+32, but... yeah. I'm being buried in work :(

Had the course I wanted, and a better course structure than offered elsewhere. No one else from my school went here - prestige, partially as well. Friendly vibe too.

So I have to prove that q(n) = 11n^2 + 32n is prime for only two integer values of n, and composite for all others. My working is: q(n) = n(11n+32) And then n = +/- 1 or 11n+32 = +/- 1. Solve for n and work out q(n) in the cases. The case for why n or 11n+32 must be 1 is easy enough...