Skip to content

A program that reads 10 numbers from the input and at the end prints the number with the largest number of primitive roots along with the number of divisors of the first number in the output. If several have this mode, it prints the largest of them.

Notifications You must be signed in to change notification settings

jopperking/Prime-Divisors-Finder

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 

Repository files navigation

بسم اللّه الرحمن الرحیم

Prime Divisors Finder!

A program that reads 10 numbers from the input and at the end prints the number with the largest number of primitive roots along with the number of divisors of the first number in the output. If several have this mode, it prints the largest of them.

Run

python3 prime_divisors_finder.py
by JopperKing

About

A program that reads 10 numbers from the input and at the end prints the number with the largest number of primitive roots along with the number of divisors of the first number in the output. If several have this mode, it prints the largest of them.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages