Name		Name	Last commit message	Last commit date
parent directory ..
Armstrong_no		Armstrong_no
Check Wagstaff Prime/CPP		Check Wagstaff Prime/CPP
GCD		GCD
Karatsuba		Karatsuba
LCM		LCM
NChooseK		NChooseK
Pollard-Rho/cpp		Pollard-Rho/cpp
Power_For_Huge_Num		Power_For_Huge_Num
Sieve of Atkin		Sieve of Atkin
catalan_no		catalan_no
euclidean distance		euclidean distance
factorial		factorial
fibonacci		fibonacci
harmonic mean		harmonic mean
hoaxnumber/python		hoaxnumber/python
juggler sequence		juggler sequence
log 2 n		log 2 n
modular exp		modular exp
modularInverse/go/src		modularInverse/go/src
palindrome		palindrome
politeness of number/python		politeness of number/python
power		power
prime factors		prime factors
reverse number		reverse number
sieve of Eratosthenes		sieve of Eratosthenes
smallest common multiple/js		smallest common multiple/js
trailing_zeros_in_factorial		trailing_zeros_in_factorial
README.md		README.md
Tower-of-Hanoi.md		Tower-of-Hanoi.md
cartesian_to_polar.cpp		cartesian_to_polar.cpp
findmax.py		findmax.py
prime.cpp		prime.cpp
primePyramid		primePyramid
prime_numbers.py		prime_numbers.py
toBinary.rb		toBinary.rb

README.md

Armstrong Number

An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits.

For instance, a 3 digit number will be considered an Armstrong number if the sum of the cubes of its digits is equal to the number itself.

For example, 153 is an Armstrong number, as 1**3 + 5**3 + 3**3 = 153