Proof only one finite field with p elements I am not sure if it is possible with my experience to prove something like this but I would be interested in how such a proof would work. I am an undergraduate and have had a Modern Algebra course so my understanding may be limited.
Essentially, I would like to prove that given two finite fields $F_p$ and $F'_p$ each with $\textit{p}$ elements that there exists an isomorphism from one field onto the other.
I am thinking I would need to define some kind of addition and multiplication table for one of the fields that satisfied the conditions for being a field. Then I would imagine you could say something like
$$f(x+y) = a_{x+y} = a_x + a_y$$
by the way we defined the addition for example. I understand this is very naive but I am just not really sure how to start.
Thank you!!
 A: A finite field with $p$ elements must have characteristic $p$. That is, $p1=1 + 1 + \cdots +1=0$ where we summed $p$ terms, and $n1\neq 0$ for $1\leq n \leq p-1.$ Thus the elements $n1$, $n=0,1,\cdots, p-1$, must all be distinct and thus make the entire field. 
So now suppose we have two fields with $p$ elements, call them $F$ and $F',$ and also suppose there exists some isomorphism $\phi$ between them. By definition of field isomorphism, we must have $\phi(1_F) = 1_{F'}.$ Then using $\phi(a+b) = \phi(a) + \phi(b) $ we get $\phi(n1_F) = n\phi(1_F) = n1_{F'}.$ This already determines $\phi$ as all elements of $F$ are of the form $n1_F,$ so if there is an isomorphism, it must be the one which sends $n1_F\mapsto n1_{F'}$. We can check that indeed, this is an isomorphism (it is injective and surjective and satisfies field homomorphism conditions). 
Thus, two fields with $p$ elements are canonically isomorphic - they are isomorphic in a very natural way, there was no choice involved in making our isomorphism. 
A: You can construct the isomorphism based on the fact that the multiplicative identity in the field must generate the field under the operation of addition if the field has order p.  
The set of elements generated by 1 form a subgroup under addition.  The order of that subgroup must divide the order of the entire additive group, p, and since the subgroup contains 0 and 1, it must have order p.  That means each element in the field must be writable as a multiple of 1.  You can then use that identification to construct your isomorphism.
