The Student Room Group

Hard maths questions...

1. The smallest positive integer n such that 5n - 1 is divisible by 36 is?

2. how many times do the graphs of log(2x) and 2log(x) intersect

3.
The function f(x) = sin(x) + cos(x) is[A] increasing in (0, pi/2)[BB] decreasing in (0, pi/2)[C] increasing in (0, pi/4) and decreasing in (pi/4, pi/2)
[D] decreasing in (0, pi/4) and increasing in (pi/4, pi/2)
(edited 7 years ago)
Reply 1
1, Note that if nN n\in \mathbb{N} then the last digit of 5n-1 is always a 4 or a 9. List all the possible last digits of multiples of 36 and it will limit the numbers you need to try so that 5n-1 is divisible by 36.
2. You're just solving log(x2)=log(2x) \log (x^2)=\log (2x) .
3. sinx+cosx \sin x + \cos x can be expressed as a single sine or cosine.
Reply 2
1st one
n = 29
5n - 1 will end either 4 or 9
Find first multiple of 36 that ends in a 4 or 9, add 1 (to make it a multiple of 5) then divide by 5 to find n

or practically the same thing but a bit clearer.

5n1=36p 5n-1 = 36p where p and n are both positive integers
Unparseable latex formula:

5n = 36p+1[br]n = $\frac {36p+1} {5}$[br]


as n is a integer, p must also be an integer.
Therefore find the first multiple of 36 where you add 1 it is divisible by 5. You will then get
144+1=145[br]145/5=n[br]n=29[br] 144 + 1 = 145[br]145 / 5 = n[br]n = 29[br]
(edited 7 years ago)
Reply 3
for 2) would it help if i said you could rewrite it as log(2)+log(x)=2log(x)?

for 3) you can differentiate and evaluate at those points :smile:

looks like two people have already answered 1).
Reply 4
Original post by B_9710
1, Note that if nN n\in \mathbb{N} then the last digit of 5n-1 is always a 4 or a 9. List all the possible last digits of multiples of 36 and it will limit the numbers you need to try so that 5n-1 is divisible by 36.
2. You're just solving log(x2)=log(2x) \log (x^2)=\log (2x) .
3. sinx+cosx \sin x + \cos x can be expressed as a single sine or cosine.


Original post by AdeptDz
1st one
n = 29
5n - 1 will end either 4 or 9
Find first multiple of 36 that ends in a 4 or 9, add 1 (to make it a multiple of 5) then divide by 5 to find n

or practically the same thing but a bit clearer.

5n1=36p 5n-1 = 36p where p and n are both positive integers
Unparseable latex formula:

5n = 36p+1[br]n = $\frac {36p+1} {5}$[br]


as n is a integer, p must also be an integer.
Therefore find the first multiple of 36 where you add 1 it is divisible by 5. You will then get
144+1=145[br]145/5=n[br]n=29[br] 144 + 1 = 145[br]145 / 5 = n[br]n = 29[br]


Original post by J_W-x
for 2) would it help if i said you could rewrite it as log(2)+log(x)=2log(x)?

for 3) you can differentiate and evaluate at those points :smile:

looks like two people have already answered 1).


Thanks
I understand 1 and 2 but dont understand 3. Also can anyone answer this question too
The number of integers greater than 6,000 that can be formed, using the digits 3, 5, 6, 7 and 8, without repetition, is.
im guessing its similar to question 1) above but not sure. Its supposed to be a big number so you wouldnt just use trial and error is there a method for it?
Original post by Carman3
Thanks
The number of integers greater than 6,000 that can be formed, using the digits 3, 5, 6, 7 and 8, without repetition, is.
im guessing its similar to question 1) above but not sure. Its supposed to be a big number so you wouldnt just use trial and error is there a method for it?

For four digit numbers,
You can pick three numbers as the first digit (3P1) and then have to choose 3 from the remaining 4 (4P3), 3P1*4P3 = 72

For 5 digit numbers
5!, as you can have any arrangement of all 5 numbers and be larger than 6000. 5!=120

add them together to get an answer (192)
(edited 7 years ago)

Quick Reply

Latest