Python: Distinct Powers
Python: Distinct Powers
ProjectEuler Problem No.29
In this project we have a sequance of numbers based on a powered number, it takes ten minites or less to write the code, test it and applay the needed figures to solve the problem. Thie code can be shorten, but I am using the classic way to write functions with comments on code.
Here is the Problem as on the ProjectEuler Portal:
Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:22=4, 23=8, 24=16, 25=32
32=9, 33=27, 34=81, 35=243
42=16, 43=64, 44=256, 45=1024
52=25, 53=125, 54=625, 55=3125
If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?
|
The Code:
#Distinct powers
#Problem 29
sequence_list=[]
def get_sequence (a):
for b in range (2,101):
if a**b not in sequence_list:
#If the elements NOT exist in the list then add it.
sequence_list.append(a**b)
for a in range (2,101):
get_sequence (a) # Calling the function
# Get the total elements in the sequence_list
print (len(sequence_list))
|
Follow me on Twitter..
Taking pictures is not my main daily practices, but when i start playing with my camera, i really enjoy my self.
Thanks for visiting my Space..
Ali's Photography Space... 