# Computation of Jacobi sums and cyclotomic numbers with reduced complexity

## TL;DR

This paper introduces a method to compute Jacobi sums and cyclotomic numbers more efficiently by reducing the number of calculations needed for a given order, simplifying their determination.

## Contribution

It proposes a novel approach that minimizes the number of Jacobi sums and cyclotomic numbers required for complete determination of a specific order.

## Key findings

- Reduced computational complexity in calculating Jacobi sums
- Fewer numbers needed for complete determination of cyclotomic numbers
- Enhanced efficiency in number theory computations

## Abstract

Jacobi sums and cyclotomic numbers are the important objects in number theory. The determination of all the Jacobi sums and cyclotomic numbers of order $e$ are merely intricate to compute. This paper presents the lesser numbers of Jacobi sums and cyclotomic numbers which are enough for the determination of all Jacobi sums and the cyclotomic numbers of a particular order.