{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd-5721"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd-5721","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"The Distribution of Primitive Roots in Fields of Order P²","abstract":"Throughout this paper, small case Latin letters, with the exception of i which has its usual mathematical meaning, will denote rational integers where we let Z represent the set of all rational integers. We call µ = a + bi a Gaussian integer iff a and b are rational integers and we denote the set of all Gaussian integers by Z(i). The set of Gaussian integers can be represented geometrically by ·the set of lattice points in a Cartesian coordinate system whose horizontal and vertical grid lines are one unit apart. Since µ = a + bi is a complex number, it has a complex conjugate denoted byµ= a - bi. The norm of µ, written as N(µ), is defined as N(µ) = µµ = a2 + b2. It is a trivial matter to show that the noun is multiplicative so that N(aB) = N(a)N(B). We say that a ≠ 0 divides. B iff there exists a µ such that B = aµ, we write a/B. A Gaussian integer w is called a unit iff w/a for all a. Since the norm is multiplicative, it can be shown that w is a unit iff N(w) = 1. Hence, the units of Z(i) are ± 1 and ± i. For any µ, we call wµ an associate iff w is a unit. A Gaussian integer p is said to be prime iff whenever p = aB , one of a or B is a unit, but not both. We call p a real prime iff p is a prime in Z(i) and Z. In contrast, primes in Z which are not primes in Z(i) are called rational primes. It is obvious that all of the associates of p as well as P are prime if P is prime. For any Gaussian integer µ, we say that a and B are congruent modulo µ, written a = B (mod µ), iff µ/ (a - B). Since congruence modulo µ is an equivalence relation on the set Z(i), it partitions Z(i) into a collection of pairwise disjoint sets whose union is Z(i). Hence, as is the case with the rational integers, we define a complete residue system modulo μ as a nonempty collection S of elements of Z(i) such that (1) no two elements of S are congruent modulo µ, and (2) every element of Z(i) not in S is congruent to some element of S. A complete residue system modulo µ is abbreviated as C.R.S.(mod µ). The purpose of this paper is to investigate the distribution of primitive roots in several special fields of order p2.","abstract_html":"Throughout this paper, small case Latin letters, with the exception of i which has its usual mathematical meaning, will denote rational integers where we let Z represent the set of all rational integers. We call µ = a + bi a Gaussian integer iff a and b are rational integers and we denote the set of all Gaussian integers by Z(i). The set of Gaussian integers can be represented geometrically by ·the set of lattice points in a Cartesian coordinate system whose horizontal and vertical grid lines are one unit apart. Since µ = a + bi is a complex number, it has a complex conjugate denoted byµ= a - bi. The norm of µ, written as N(µ), is defined as N(µ) = µµ = a2 + b2. It is a trivial matter to show that the noun is multiplicative so that N(aB) = N(a)N(B). We say that a ≠ 0 divides. B iff there exists a µ such that B = aµ, we write a/B. A Gaussian integer w is called a unit iff w/a for all a. Since the norm is multiplicative, it can be shown that w is a unit iff N(w) = 1. Hence, the units of Z(i) are ± 1 and ± i. For any µ, we call wµ an associate iff w is a unit. A Gaussian integer p is said to be prime iff whenever p = aB , one of a or B is a unit, but not both. We call p a real prime iff p is a prime in Z(i) and Z. In contrast, primes in Z which are not primes in Z(i) are called rational primes. It is obvious that all of the associates of p as well as P are prime if P is prime. For any Gaussian integer µ, we say that a and B are congruent modulo µ, written a = B (mod µ), iff µ/ (a - B). Since congruence modulo µ is an equivalence relation on the set Z(i), it partitions Z(i) into a collection of pairwise disjoint sets whose union is Z(i). Hence, as is the case with the rational integers, we define a complete residue system modulo μ as a nonempty collection S of elements of Z(i) such that (1) no two elements of S are congruent modulo µ, and (2) every element of Z(i) not in S is congruent to some element of S. A complete residue system modulo µ is abbreviated as C.R.S.(mod µ). The purpose of this paper is to investigate the distribution of primitive roots in several special fields of order p2.","abstract_has_math":false,"creators":["Gerjets, Marilyn Sol"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - Open Access","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:01:31Z","subjects":[],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd/4690","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd/4690","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://openprairie.sdstate.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopenprairie.sdstate.edu%3Aetd-5721","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Gerjets, Marilyn Sol"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["1972-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - Open Access"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd/4690"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Throughout this paper, small case Latin letters, with the exception of i which has its usual mathematical meaning, will denote rational integers where we let Z represent the set of all rational integers. We call µ = a + bi a Gaussian integer iff a and b are rational integers and we denote the set of all Gaussian integers by Z(i). The set of Gaussian integers can be represented geometrically by ·the set of lattice points in a Cartesian coordinate system whose horizontal and vertical grid lines are one unit apart. Since µ = a + bi is a complex number, it has a complex conjugate denoted byµ= a - bi. The norm of µ, written as N(µ), is defined as N(µ) = µµ = a2 + b2. It is a trivial matter to show that the noun is multiplicative so that N(aB) = N(a)N(B). We say that a ≠ 0 divides. B iff there exists a µ such that B = aµ, we write a/B. A Gaussian integer w is called a unit iff w/a for all a. Since the norm is multiplicative, it can be shown that w is a unit iff N(w) = 1. Hence, the units of Z(i) are ± 1 and ± i. For any µ, we call wµ an associate iff w is a unit. A Gaussian integer p is said to be prime iff whenever p = aB , one of a or B is a unit, but not both. We call p a real prime iff p is a prime in Z(i) and Z. In contrast, primes in Z which are not primes in Z(i) are called rational primes. It is obvious that all of the associates of p as well as P are prime if P is prime. For any Gaussian integer µ, we say that a and B are congruent modulo µ, written a = B (mod µ), iff µ/ (a - B). Since congruence modulo µ is an equivalence relation on the set Z(i), it partitions Z(i) into a collection of pairwise disjoint sets whose union is Z(i). Hence, as is the case with the rational integers, we define a complete residue system modulo μ as a nonempty collection S of elements of Z(i) such that (1) no two elements of S are congruent modulo µ, and (2) every element of Z(i) not in S is congruent to some element of S. A complete residue system modulo µ is abbreviated as C.R.S.(mod µ). The purpose of this paper is to investigate the distribution of primitive roots in several special fields of order p2."]},{"key":"dc:title","label":"Title","values":["The Distribution of Primitive Roots in Fields of Order P²"]}]}],"canonical_facts":{"dc:creator":["Gerjets, Marilyn Sol"],"dc:date.created":["1972-01-01T08:00:00Z"],"dc:description.abstract":["Throughout this paper, small case Latin letters, with the exception of i which has its usual mathematical meaning, will denote rational integers where we let Z represent the set of all rational integers. We call µ = a + bi a Gaussian integer iff a and b are rational integers and we denote the set of all Gaussian integers by Z(i). The set of Gaussian integers can be represented geometrically by ·the set of lattice points in a Cartesian coordinate system whose horizontal and vertical grid lines are one unit apart. Since µ = a + bi is a complex number, it has a complex conjugate denoted byµ= a - bi. The norm of µ, written as N(µ), is defined as N(µ) = µµ = a2 + b2. It is a trivial matter to show that the noun is multiplicative so that N(aB) = N(a)N(B). We say that a ≠ 0 divides. B iff there exists a µ such that B = aµ, we write a/B. A Gaussian integer w is called a unit iff w/a for all a. Since the norm is multiplicative, it can be shown that w is a unit iff N(w) = 1. Hence, the units of Z(i) are ± 1 and ± i. For any µ, we call wµ an associate iff w is a unit. A Gaussian integer p is said to be prime iff whenever p = aB , one of a or B is a unit, but not both. We call p a real prime iff p is a prime in Z(i) and Z. In contrast, primes in Z which are not primes in Z(i) are called rational primes. It is obvious that all of the associates of p as well as P are prime if P is prime. For any Gaussian integer µ, we say that a and B are congruent modulo µ, written a = B (mod µ), iff µ/ (a - B). Since congruence modulo µ is an equivalence relation on the set Z(i), it partitions Z(i) into a collection of pairwise disjoint sets whose union is Z(i). Hence, as is the case with the rational integers, we define a complete residue system modulo μ as a nonempty collection S of elements of Z(i) such that (1) no two elements of S are congruent modulo µ, and (2) every element of Z(i) not in S is congruent to some element of S. A complete residue system modulo µ is abbreviated as C.R.S.(mod µ). The purpose of this paper is to investigate the distribution of primitive roots in several special fields of order p2."],"dc:identifier":["https://openprairie.sdstate.edu/etd/4690"],"dc:language":["en"],"dc:title":["The Distribution of Primitive Roots in Fields of Order P²"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Thesis - Open Access"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T09:01:31Z"}