Skip to content

BryceHowell/permutation_polynomials

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

permutation_polynomials

This code generates all polynomials that form permutations over a modular arithmetic p, where p is prime. The permutations plus their corresponding polynomial are saved to file (perm_poly.txt).

compiling

Place all files in a directory, then:

$ g++ -o permute permute.cpp matrix.cpp

running

 $ permute <small prime value>

warning

This module will segfault if you enter a composite number. It will also consume a lot of disk space for primes above 7. I recommend not going above 11, which consumed at least 2 gigabytes on my hard drive.

About

some code that generates permutation polynomials.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages