Recall that a number is divisible by 3 if and only if the sum of its digits is a multiple of 3. So just find how many ways you can form numbers from that so that the digit sum is a multiple of 3.
What is the best (HSC) method to do part (d)? Thanks in advance.
Alright, thanks! ^.^Recall that a number is divisible by 3 if and only if the sum of its digits is a multiple of 3. So just find how many ways you can form numbers from that so that the digit sum is a multiple of 3.
I also learnt a little trick today
if you have something like
tanθ>2⁄5View attachment 33248
I found the general formula
Then found T14 and T15
Then made T14/T15 > 1
I then simplified and got sinOcos^9O > 6/15 where O is theta
However I think this is wrong and I don't know where I have gone wrong.
Answers says Theta = 22 degrees
Do you mean 5c) and d)?Can someone show the working out to these questions:
View attachment 33270 - Q4c and d
Extensions question 16 and 17c
View attachment 33271
View attachment 33272
If a quadratic can be factorised in a form of a perfect square,it would only have one root, and letting the discriminant equal to 0 implies there's only one root.why would u let the discriminant equal to 0?
Assume a, b real.for q.16 am I supposed to find the discriminant let it equal to 0. What is the next step?