Thank you for trying to help me!
 

Okay, so I need to understand primitive polynomials, but I haven't got much in the way of math.
Good brain and willing to learn but no school, really.

Please help me understand {this page explaining primitive polynomials}!

Also {this other page of the same}, which seems more basic but is still difficult.

{The easiest one of all}, but again, I don't get it! :'[

The only kind I need to understand is the {kind which is used in LFSRs}, which is called GF(2), right?

I need to be able to generate every primitive polynomial in GF(2) of a given degree.

{This paper discusses what must be the fastest way to test if a polynomial is primitive} - I don't understand what he's saying though.  Probably because I don't understand the definition of a primitive polynomial.

I don't want code, I just want to understand the properties required to make a polynomial "primitive".

The point is that I need to understand it enough to write the code for it.


Sorry if that's confusing.  Simply put, all I need to do is find every primitive polynomial of degree n for GF(2) using one of the algorithms provided, and in order to do that I need to understand what makes a polynomial primitive.

Thank you for trying to help me!
 

Okay, so I need to understand primitive polynomials, but I haven't got much in the way of math.
Good brain and willing to learn but no school, really.

Please help me understand {this page explaining primitive polynomials}!

Also {this other page of the same}, which seems more basic but is still difficult.

The only kind I need to understand is the kind which is used in LFSRs, which is called GF(2), right?

I need to be able to generate every primitive polynomial in GF(2) of a given degree.

{this paper discusses what must be the fastest way to test if a polynomial is primitive} - I don't understand what he's saying though.

I don't want code, I just want to understand the properties required to make a polynomial "primitive".

The point is that I need to understand it enough to write the code for it.


Sorry if that's confusing.  Simply put, all I need to do is find every primitive polynomial of degree n for GF(2) using one of the algorithms provided, and in order to do that I need to understand what makes a polynomial primitive.

Thank you for trying to help me!
 

Okay, so I need to understand primitive polynomials, but I haven't got much in the way of math.
Good brain and willing to learn but no school, really.

Please help me understand {this page explaining primitive polynomials}!

Also {this other page of the same}, which seems more basic but is still difficult.

The only kind I need to understand is the kind which is used in LFSRs, which is called GF(2), right?

I need to be able to generate every primitive polynomial in GF(2) of a given degree.

{this paper discusses what must be the fastest way to test if a polynomial is primitive} - I don't understand what he's saying though.

I don't want code, I just want to understand the properties required to make a polynomial "primitive".

The point is that I need to understand it enough to write the code for it.


Sorry if that's confusing.  Simply put, all I need to do is find calculate every primitive polynomial of degree n for GF(2) using one of the algorithms provided, and in order to do that I need to understand what makes a polynomial primitive.

Thank you for trying to help me!
 

Okay, so I need to understand primitive polynomials, but I haven't got much in the way of math.
Good brain and willing to learn but no school, really.

Please help me understand {this page explaining primitive polynomials}!

Also {this other page of the same}, which seems more basic but is still difficult.

The only kind I need to understand is the kind which is used in LFSRs, which is called GF(2), right?

I need to be able to generate every primitive polynomial in GF(2) of a given degree.

{this paper discusses what must be the fastest way to test if a polynomial is primitive} - I don't understand what he's saying though.

I don't want code, I just want to understand the properties required to make a polynomial "primitive".

The point is that I need to understand it enough to write the code for it.

THANK YOU FOR TAKING THE TIME TO HELP ME

I need to understand primitive polynomials, but lets say I got a B-- in math.

Zero calculus exposure.

Please help me understand {this page explaining primitive polynomials} without so much jargon.

Also {this other page of the same}, which seems more basic but still confuses me a bit too much.

The only kind I need to understand is the kind which is used in LFSRs, which I guess is GF(2)??

GF(2) is simply the name of the type of field I'm working with, right?  As defined by its base?

I need to be able to generate every primitive polynomial in GF(2) of a given degree.

That's all I need to do.  But I also need to understand /why/ it works, or /how/ it works, or anything!

I also cannot understand {this paper, which discusses the fastest way to test if a polynomial is primitive}.

I don't want code, I just want to understand the properties required to make a polynomial "primitive".