(Original post by CherGalois)
i understand that my mathematical ability may well look so astonishing to you that it requires an unnatural means to be as good as me, but i can assure you this is not so. Atleast i waited till morning to reply so you could have one last dream, one last hope...
unfortunately, my mathematical abilities are intrinsically natural and have only been developed thus far due to my own natural abilities.
This is the same for all oxford mathmos....maybe one day with all your hard work you may bathe in a glory similar to mine.
What sort of level of number theory do you know?(Original post by souktik)
Umm, hey, does anyone have some nice problems on combinatorics? Or on elementary number theory? I feel like solving problems, but not scary integrals.

 Follow
 2561
 14122013 18:45

 Follow
 2562
 14122013 18:51
(Original post by Lord of the Flies)
This is merely an exercise if one knows a bit of complex analysis, and is a massive slog otherwise...<br />
<br />
Here is something for the new year!<br />
<br />
<b>Problem 420**</b><br />
<br />
If converges, does converge What about <br />
<br />
<b>Problem 421***</b><br />
<br />
<br />
What method might one use without complex analysis that turns out to be a slog ? 
 Follow
 2563
 14122013 18:52
(Original post by DJMayes)
What sort of level of number theory do you know?
Posted from TSR Mobile 
Tarquin Digby
 Follow
 0 followers
 9 badges
 Send a private message to Tarquin Digby
Offline9ReputationRep: Follow
 2564
 14122013 19:01
Problem 422*
Easy number theory one.
Find all prime numbers such that for some integer , the expression is a prime power. 
Lord of the Flies
 Follow
 29 followers
 18 badges
 Send a private message to Lord of the Flies
Offline18ReputationRep: Follow
 2565
 14122013 19:12
(Original post by IceKidd)
What method might one use without complex analysis that turns out to be a slog ? 
 Follow
 2566
 14122013 19:18
(Original post by Tarquin Digby)
Problem 422*
Easy number theory one.
Find all prime numbers such that for some integer , the expression is a prime power.
.
So and , where .
By substituting into , we get that .
Since p and q are both primes
.
Also consider the case .
.
Then either , which gives us the result , as 2 and 3 are the only consecutive integers that are both primes.
Or . Now . The only possible values that the Mersenne primes less than 1000.Last edited by 0x2a; 14122013 at 19:56. 
Tarquin Digby
 Follow
 0 followers
 9 badges
 Send a private message to Tarquin Digby
Offline9ReputationRep: Follow
 2567
 14122013 19:36
(Original post by 0x2a)
, where p and q are primes.
.
So and , where .
By substituting into , we get that .
Since p and q are both primes
.
Consider p = 3 and n = 4. 
 Follow
 2568
 14122013 19:39
(Original post by Tarquin Digby)
No  There are many more primes actually.
Consider p = 3 and n = 4. 
 Follow
 2569
 14122013 19:54
(Original post by Tarquin Digby)
Problem 422*
Easy number theory one.
Find all prime numbers such that for some integer , the expression is a prime power.
Solution 422
Spoiler:Show
Write for some prime q. From this, we can deduce that either:
or
Assume both are true. Then, we must have , so p=q. Equivalently, n=kq, from which we obtain:
As q is prime, this is clearly only possible if k=2, q=2, m=3. Then, p=2.
Next, assume that only one is true. Clearly we cannot have the RHS true without the LHS. Then, we must have n  p = 1, n=p+1, giving us:
So, q=2, and all our other primes must be of the form 2^m  1, i.e. all possible primes are:
2, 3, 7, 31, 127

 Follow
 2570
 14122013 20:03
(Original post by Lord of the Flies)
If you try proving it, you will find that it is more interesting than it initially looks. 
Tarquin Digby
 Follow
 0 followers
 9 badges
 Send a private message to Tarquin Digby
Offline9ReputationRep: Follow
 2571
 14122013 20:03
(Original post by DJMayes)
Is this correct?
Solution 422
Spoiler:Show
Write for some prime q. From this, we can deduce that either:
or
Assume both are true. Then, we must have , so p=q. Equivalently, n=kq, from which we obtain:
As q is prime, this is clearly only possible if k=2, q=2, m=3. Then, p=2.
Next, assume that only one is true. Clearly we cannot have the RHS true without the LHS. Then, we must have n  p = 1, n=p+1, giving us:
So, q=2, and all our other primes must be of the form 2^m  1, i.e. all possible primes are:
2, 3, 7, 31, 127

 Follow
 2572
 15122013 14:50
(Original post by CherGalois)
u=x, and im not suggesting its an odd function
Problem 423***
Prove that
Extension:
Then show that there exists a positive constant k for every such that:
Last edited by Llewellyn; 15122013 at 14:52. 
 Follow
 2573
 15122013 15:16
(Original post by Lord of the Flies)
This is merely an exercise if one knows a bit of complex analysis, and is a massive slog otherwise... 
CherGalois
 Follow
 0 followers
 0 badges
 Send a private message to CherGalois
Offline0ReputationRep: Follow
 2574
 15122013 15:28
(Original post by Llewellyn)
There is a much cleaner way to explain this but a solution is a solution I guess.<br />
<br />
<b>Problem 423***</b><br />
Prove that<br />
<br />
<br />
Extension:<br />
Then show that there exists a positive constant k for every such that:<br />
<br />
What would you say the cleaner way to explain it is? 
 Follow
 2575
 19122013 02:06
(Original post by Tarquin Digby)
I thought you're not allowed to integrate over a discontinuity? (denominator is 0 when x=0)
If you consider the limit on either side then the integral is still possible; although thinking critically like this is good. I can't remember if that is covered at ALevel so if you are an ALevel student don't worry about it too much.
(For instance, think about the graph of sin(x).(x^(1))
(Original post by CherGalois)
What would you say the cleaner way to explain it is?
For instance, what DJM did was nice to show it can be reduced down to sin(nx)/sinx. Alternatively you can split the limits and apply the substitution to just one integral. Then you can mention a reduction formula can be shown via basic trig identities. You don't have to latex it, you can briefly go over your method, but I think "u=x" is insufficient to claim a 'solution'. If you are going to take the time to reply, it's probably best to give a meaningful reply.Last edited by Llewellyn; 19122013 at 02:07. 
CherGalois
 Follow
 0 followers
 0 badges
 Send a private message to CherGalois
Offline0ReputationRep: Follow
 2576
 19122013 07:42
My u=x substitutiom clesrly led to sinnx/sinx djmayes just copied my solution.. which is fine as he pereservered with it which is always a nice quality to see in mathematicians.
(Original post by Llewellyn)
Sorry I missed this reply.
If you consider the limit on either side then the integral is still possible; although thinking critically like this is good. I can't remember if that is covered at ALevel so if you are an ALevel student don't worry about it too much.
(For instance, think about the graph of sin(x).(x^(1))
Well most coherent replies would qualify as a better explanation.
For instance, what DJM did was nice to show it can be reduced down to sin(nx)/sinx. Alternatively you can split the limits and apply the substitution to just one integral. Then you can mention a reduction formula can be shown via basic trig identities. You don't have to latex it, you can briefly go over your method, but I think "u=x" is insufficient to claim a 'solution'. If you are going to take the time to reply, it's probably best to give a meaningful reply.
(Original post by Llewellyn)
Sorry I missed this reply.
If you consider the limit on either side then the integral is still possible; although thinking critically like this is good. I can't remember if that is covered at ALevel so if you are an ALevel student don't worry about it too much.
(For instance, think about the graph of sin(x).(x^(1))
Well most coherent replies would qualify as a better explanation.
For instance, what DJM did was nice to show it can be reduced down to sin(nx)/sinx. Alternatively you can split the limits and apply the substitution to just one integral. Then you can mention a reduction formula can be shown via basic trig identities. You don't have to latex it, you can briefly go over your method, but I think "u=x" is insufficient to claim a 'solution'. If you are going to take the time to reply, it's probably best to give a meaningful reply. 
CherGalois
 Follow
 0 followers
 0 badges
 Send a private message to CherGalois
Offline0ReputationRep: Follow
 2577
 19122013 07:44
(Original post by Tarquin Digby)
It's not covered very well at A level at all. We're just told: If the denominator is 0 in the open interval then 'you can't do it'. It would be nice to know exactly why. 
FireGarden
 Follow
 7 followers
 14 badges
 Send a private message to FireGarden
Offline14ReputationRep: Follow
 2578
 19122013 23:31
(Original post by Tarquin Digby)
It's not covered very well at A level at all. We're just told: If the denominator is 0 in the open interval then 'you can't do it'. It would be nice to know exactly why.Last edited by FireGarden; 19122013 at 23:33. 
 Follow
 2579
 21122013 11:57
(Original post by CherGalois)
Isnt it a bit obbious...if it is undefined at a point in the interval then there is an asymptote there and the graph never finitrly finishes as it infinitely tends to this point so the area is infinite. It can then be evaluated in scenarios where a limit at this value exists on both sides (if integratint across the discontinuity)
has finite area, despite having an asymptote.
Edit: Please be clearer, I don't see how the above is not a counterexample to your claim.Last edited by henpen; 21122013 at 19:33. 
CherGalois
 Follow
 0 followers
 0 badges
 Send a private message to CherGalois
Offline0ReputationRep: Follow
 2580
 21122013 12:44
(Original post by henpen)
I'm not quite sure what you mean, but
has finite area, despite having an asymptote.
 The Proof is 'notso' Trivial  Physics Edition
 Matrices: detA=0 > there exists a nontrivial solution to Ax=0 ...
 Stuck on a proof!
 Slight ambiguity in STEP question
 Extremely difficult lower triangular matrices question proof ...
 Is there a bottom line to what should be proven?
 Proof by Induction ( Algebra Year 1 Uni)
 Recursive unprovability
 Preparing for proofbased mathematics at university
 Progressing on to university proofbased mathematics

University of Edinburgh

Secondary Mathematics with Science with QTS (2 years)
University of South Wales

University of Oxford

University of Greenwich

University of Glasgow

University of Oxford

Computer Science with Mathematics with a Year in Industry (5 years)
University of Sheffield

Computing Science and Mathematics
University of Stirling

University of Bolton

Liverpool Hope University
We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.
 SherlockHolmes
 Notnek
 charco
 Mr M
 Changing Skies
 F1's Finest
 rayquaza17
 RDKGames
 davros
 Gingerbread101
 Kvothe the Arcane
 TeeEff
 The Empire Odyssey
 Protostar
 TheConfusedMedic
 nisha.sri
 claireestelle
 Doonesbury
 furryface12
 Amefish
 harryleavey
 Lemur14
 brainzistheword
 Rexar
 Sonechka
 TheAnxiousSloth
 EstelOfTheEyrie
 CoffeeAndPolitics
 an_atheist
 Labrador99
 EmilySarah00