Document Type

Article

Publication Date

1985

Digital Object Identifier (DOI)

https://doi.org/10.1155/S0161171285000394

Abstract

A partition over finite field is defined and each equivalence class is constructed and represented by a set called the fundamental set. If a primitive element is used to construct the addition table over these fundamental sets then all additions over the field can be computed. The number of partitions is given for some finite fields.

Rights Information

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Was this content written or created while at USF?

Yes

Citation / Publisher Attribution

International Journal of Mathematics and Mathematical Sciences, v. 8, art. 175281

Share

COinS