Actually, I'll give you a question on groups:(Original post by Farhan.Hanif93)
If only I could understand groups by doing integrals, then I'd be on to something...
Out of interest, are questions on things like groups etc. suitable for this thread?
Problem 26 ***
Let and be finite groups such that and are coprime and let .
Set and
Show that

 Follow
 101
 09042013 03:30

 Follow
 102
 09042013 03:42
Here's an additional problem:
Problem 27 **/*** (the ** rating very loosely)
Let . Determine
Also, show that your result is consistent with the fact the volume of the unit sphere is 
 Follow
 103
 09042013 10:24
(Original post by Boy_wonder_95)
2 to the power of 60  1 = 1152921504606846795
1152921504606846795 / 61 = 18900352534538475
Therefore it's divisible by 61. Problem solved 
 Follow
 104
 09042013 11:48
(Original post by ukdragon37)
Excellent. However the steps after this point can also be completed (more cleanly I think) without the use of contradiction.
Consider any satisfying . Since we have . Hence by induction for any natural and therefore any satisfying is an upper bound for the CPO . However out of all of them is the supremum of the CPO, so by definition the smallest.
The point of the question was to get you to prove an instance of Kleene's fixedpoint theorem.
I wanted to ask you several questions. What can we say about the function that enumerates the set of fixed points of ? I mean, are there any special properties which that function has?
Solution 25
1. Consider two cases:
If A is finite, then suppose is a surjection. Consequently, contradiction.
Now let be infinite. Suppose there exists surjection . For every , . Denote .
Since is surjective, there must be some with . Hence and , which is a contradiction.
Therefore, even if is infinite, we have .
2. The number of mappings from to is . Hence no surjection from the set of all maps from to to the set exists.
3. It is quite wellknown that . I think we can use the fact that . Then we shall find injections between and . Finally, Bernstein–Schroeder's theorem shows that . It would be interesting if we can construct bijection.Last edited by Mladenov; 09042013 at 12:08. 
Indeterminate
 Follow
 162 followers
 3 badges
 Send a private message to Indeterminate
 Political Ambassador
Offline3ReputationRep:Political Ambassador Follow
 105
 09042013 12:33
Last edited by Indeterminate; 09042013 at 12:36. 
jack.hadamard
 Follow
 0 followers
 1 badge
 Send a private message to jack.hadamard
Offline1ReputationRep: Follow
 106
 09042013 12:46
(Original post by Farhan.Hanif93)
... 
ukdragon37
 Follow
 25 followers
 12 badges
 Send a private message to ukdragon37
Offline12ReputationRep: Follow
 107
 09042013 14:18
(Original post by Mladenov)
2. The number of mappings from to is . Hence no surjection from the set of all maps from to to the set exists.
(Original post by Mladenov)
3. It is quite wellknown that . I think we can use the fact that . Then we shall find injections between and . Finally, Bernstein–Schroeder's theorem shows that . It would be interesting if we can construct bijection.
(Original post by Mladenov)
Thank you for your remark.
I wanted to ask you several questions. What can we say about the function that enumerates the set of fixed points of ? I mean, are there any special properties which that function has?[B]
Consider a higherorder function , which takes a function from a set to the same set and outputs a value in that set and has the property:
In other words, given a function , is guaranteed to compute a fixed point of (although not necessarily a particular one such as the lowest).
Now if we define say a factoriallike function such that:
which has fixed points for all n. Suppose we have a particular instance of Y which is is builtin to "try" a starting value of say (3,1) and then repeatedly compute until it fixes, we would then have , and this indeed is one fixed point of t. Different fixed points can thus be extracted by having different fixedpoint combinators that try different starting values.
Hence we can construct a higherorder function which enumerates all of the fixed points of a function f by first enumerating the elements of the domain of f and then use them as the starting values in different fixedpoint combinators to exhaustively compute the fixed point reachable from each element.
If we view recursive functions as programs, then a fixed point of a function is the computational result of the corresponding program which can be reached from some input  the attempted starting value. A function which creates a set of all fixed points therefore creates a set of all halting computation results. We normally don't deal with such a function since usually we are only interested in a single result from a single interesting input, or we wish to only look at the least (occasionally greatest) fixed points for their own special properties.
Of course, if the resulting set of fixed points is empty then it means the function/program never produces a result  i.e. it does not halt. Since the halting problem is undecidable, this shows the function which computes all fixed points is not computable in finite time.
Further reading (although it might be a bit too deep): Kleene's recursion theoremsLast edited by ukdragon37; 09042013 at 14:28. 
 Follow
 108
 09042013 14:39
Solution 24
. Consider . All the non trivial th roots of unity are roots of . Hence .
Thence, .
Note the identity , and get .
(Original post by ukdragon37)
.....
Suppose there is a surjection . Therefore, we can denote by . Define , where . Then is obviously not in .
In the infinite case, can be proved similarly.
Tarski's fixed point theorem is quite powerful. It is more general than Kleene's theorem. With this theorem anyone can construct bijection  task, which seems rather tough otherwise.
Thanks for your explanation.
Kleene's recursion theorems appear to be exciting, yet I have not covered any recursion theory, which impedes considerably my comprehension of them.Last edited by Mladenov; 09042013 at 16:54. 
Indeterminate
 Follow
 162 followers
 3 badges
 Send a private message to Indeterminate
 Political Ambassador
Offline3ReputationRep:Political Ambassador Follow
 109
 09042013 16:29
Problem 28 *
Determine whether or not the line
intersects the circle, C, with equation
If it does, give the coordinates.
Is the line ever a tangent to C?Last edited by Indeterminate; 09042013 at 17:45. 
 Follow
 110
 09042013 17:22
@Indeterminate, your problem should be 28.
Problem 29**
Let be a sequence of positive integers satisfying the following condition: for each . Then there exist infinitely many ordered pairs of distinct positive integers such that . 
Felix Felicis
 Follow
 31 followers
 13 badges
 Send a private message to Felix Felicis
Offline13ReputationRep: Follow
 111
 10042013 02:28
(Original post by shamika)
(I wanted to edit this to restrict the choice of n, but actually it makes little difference. Do people need a hint?) 
Boy_wonder_95
 Follow
 44 followers
 15 badges
 Send a private message to Boy_wonder_95
Offline15ReputationRep: Follow
 112
 10042013 03:25
(Original post by Stargirl)
I suppose that works but the intention was that you weren't meant to evaluate .
(Original post by Felix Felicis)
...Last edited by Boy_wonder_95; 10042013 at 03:32. 
 Follow
 113
 10042013 03:31
(Original post by Boy_wonder_95)
What happened to Richard Feynman? 
Boy_wonder_95
 Follow
 44 followers
 15 badges
 Send a private message to Boy_wonder_95
Offline15ReputationRep: Follow
 114
 10042013 03:38
(Original post by Noble.)
He died in 1988 from cancer. 
 Follow
 115
 10042013 03:39
(Original post by Boy_wonder_95)
I meant as in his dp, as he is Felix's idol 
 Follow
 116
 10042013 08:35
(Original post by Felix Felicis)
I was having trouble understanding your notation more than anything But I'll have a go  just to confirm, S is the set of triples which add up to the number 'n' and the question is to evaluate the sum of the product of the triples of each set of integers that add up to make n? 
und
 Follow
 15 followers
 16 badges
 Send a private message to und
 Thread Starter
Offline16ReputationRep: Follow
 117
 10042013 12:48
(Original post by shamika)
Yep, that's right 
 Follow
 118
 10042013 13:02
(Original post by und)
Does the order matter? Eg. is (1,1,2) the same as (1,2,1)?
I should've made it clear that i, j and k are positive integers.Last edited by shamika; 10042013 at 13:04. 
 Follow
 119
 10042013 13:32
Hint (Problem 23)
Spoiler:Show
There should be a more concise solution.Last edited by Mladenov; 10042013 at 14:26. 
ThatRandomGuy
 Follow
 0 followers
 1 badge
 Send a private message to ThatRandomGuy
Offline1ReputationRep: Follow
 120
 10042013 13:45
Subbing...
Reply
Submit reply
Related discussions:
 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
 Maths Breakthroughs
 Is there a bottom line to what should be proven?
 Recursive unprovability
 Preparing for proofbased mathematics at university
 Progressing on to university proofbased mathematics
 Convergent sequence meromorphic function proof periods ...
TSR Support Team
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.
This forum is supported by:
 SherlockHolmes
 Notnek
 charco
 Mr M
 TSR Moderator
 Nirgilis
 usycool1
 Changing Skies
 James A
 rayquaza17
 RDKGames
 randdom
 davros
 Gingerbread101
 Kvothe the Arcane
 The Financier
 The Empire Odyssey
 Protostar
 TheConfusedMedic
 nisha.sri
 Reality Check
 claireestelle
 Doonesbury
 furryface12
 Amefish
 harryleavey
 Lemur14
 brainzistheword
 Rexar
 Sonechka
 LeCroissant
 EstelOfTheEyrie
 CoffeeAndPolitics
 an_atheist
 Moltenmo
Updated: December 11, 2017
Share this discussion:
Tweet