Skip to content

An Achilles number is a number that is powerful but not a perfect power.[1] A positive integer n is a powerful number if, for every prime factor p of n, p2 is also a divisor. In other words, every prime factor appears at least squared in the factorization. All Achilles numbers are powerful. However, not all powerful numbers are Achilles numbers:…

Notifications You must be signed in to change notification settings

petros-athan/Achilles-number

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

Achilles-number

An Achilles number is a number that is powerful but not a perfect power. A positive integer n is a powerful number if, for every prime factor p of n, p2 is also a divisor. In other words, every prime factor appears at least squared in the factorization. All Achilles numbers are powerful. However, not all powerful numbers are Achilles numbers: only those that cannot be represented as mk, where m and k are positive integers greater than 1. Achilles numbers were named by Henry Bottomley after Achilles, a hero of the Trojan war, who was also powerful but imperfect. Strong Achilles numbers are Achilles numbers whose Euler totients are also Achilles numbers.

In this code I was not allowed by my professor to use the c functions nor was I allowed to create my own.

This code writing 8/2018. This is my first exam, from the first year in my university

About

An Achilles number is a number that is powerful but not a perfect power.[1] A positive integer n is a powerful number if, for every prime factor p of n, p2 is also a divisor. In other words, every prime factor appears at least squared in the factorization. All Achilles numbers are powerful. However, not all powerful numbers are Achilles numbers:…

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages