hi there, i need a help about this excersise:

A grammatically fluctuating feedback with feedback (Shift Register, LFSR). The program is required or appears as parameters: 3.1 the number of LFSR digits 3.2 initial value of LFSR in binary system 3.3 The number of cycles he will look for. If the number given by the user is 0, it will run for 2^n circles The program, accordingly with the result of LFSR should choose a primitive polynomial for LFSR from the according table: Bits (n) | Feedback polynomial| Period 2 x2+x+1 3 3 x3+x2+1 7 4 X4+x3+1 15 5 X5+x3+1 31 6 X6+x5+1 63 7 X7+x6+1 127 8 X8+x6+x5+x4+1 255 9 X9+x5+1 511 10 X10+x7+1 1,023 11 X11+x9+1 2,047 12 X12+x11+x10+x4+1 4,095

the only thing that i want is just to help me on how to start with this (or to understand more about this excersise) so i could continue and solve the problem by myself.

Thanks.

As for the problem i solved it,

thank's for your reply.