Take a closer look at the proof and conditions of conjecture 2 in chapter 1. It states that if you have a positive integer n that isn't prime (i.e it is n=ab for positive integers a and b both less than n, then the integer given by (2^n)-1 = (2^ab) - 1 is not prime either.
But the proof itself for that conjecture gives you a means of computing integer factors x and y of any such number where n is not prime. It uses the telescoping property of sums to prove in general under these conditions that:
(2^n) - 1 = ( (2^b) -1 ) * y
That is, one of the two factors you are looking for takes the form x = (2^b) - 1.
So let's use this to solve part (a) as an example. (2^15) -1 = 32767 is not prime according to conjecture 2 because 15=3*5, a product of positive integers less than n=15 . Now plug it into the equation with a = 3 and b = 5:
( ( 2^3*5 ) - 1 ) = ( (2^5) - 1 ) * y
Now you just solve for y:
y = ( ( 2^3*5 ) - 1 ) / ( ( 2^5 )- 1 ) = 1057
And we already had x = (2^5) -1 = 31
We may now easily confirm the result by multiplying: 1057 * 31 = 32767.
To apply this to part b, all that remains is to repeat the process with a = 31 and b = 1057.