Archive
Python: Prime Numbers in Range
Python: Prime Numbers in a Range
Our task here is simple as the title, we will have a range and will test each number to see if it is a prime then we will add it to a list, once we finish we will print out the list.
To complete this task we will use one of our function we create last time (Read: is prime post).
So, here we will ask the user to input two numbers num1 and num2 the we will pass all the numbers in the range to is_prime() and store the result in a list.
The Code:
#Function to get all Prime numbers in a range.
#Ask the user to enter two numbers
print ‘Get all Prime numbers in a range\n’
num1=int(input(“Enter the first number in the range: “))
num2=int(input(“Enter the last number in the range: “))
#create the list
prime_list=[]
def get_all_prime(num1,num2):
for x in range (num1,num2):
if is_prime(x) ==’Prime’:
prime_list.append(x)
return prime_list
#Call the function and print the list
get_all_prime(num1,num2)
print prime_list
print len(prime_list)
Python Project: Sum of the Square and Square of the Sum
Python: Sum of the Square and Square of the Sum
Difference of sum of the square and the square of the sum
I fond this on projecteuler.net Usually I add some steps to there problems to make it more application look and feel. Later on, we’ll see how.
Problem assumption: If we said that we have a range of numbers (1,10) then the sum of this range is 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 = 55, Now the Square of the sum is 55^2; thats mean the Square of the sum of (55) = 3025.
And for the same range, the Sum of Square means that we will get the Square of each number in the range then will get there summation. So with our range (1,10) Sum of Square is 1^2 + 2^2 + 3^2 + 4^2 + 5^2 …. + 10^2 = 385
The Problem #6 in ProjectEuler
The sum of the squares of the first ten natural numbers is,12 + 22 + … + 102= 385
The square of the sum of the first ten natural numbers is,(1 + 2 + … + 10)2 = 552= 3025
Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.
The Task:Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
Inhancment Now to make this task workking as application and to get more general output of it, first we will ask the user to input a range of the numbers, then we will applay the function on that range.
The Code:
# Problem 6 in ProjectEuler.
def square_of_sum(num1, num2):
tot = 0
for x in range(num1, num2+1):
tot = tot+x
print(‘The Square of the Sun’,tot*tot)
return tot*tot
def sum_of_square(num1, num2):
tot = 0
for x in range(num1, num2+1):
tot = tot+(x*x)
print(‘The Sum of the Square ‘, tot)
return tot
#Ask the user for his input.
num1 = int(input(‘Enter First number in the range: ‘))
num2 = int(input(‘Enter the last number in the range: ‘))
#Call the functions.
w1 = square_of_sum(num1, num2)
w2 = sum_of_square(num1, num2)
#Output the Difference.
print(‘The Difference is: ‘, w1-w2)
Python Project: Is it a Prime
Python: Prime Number
Is it Prime
In a simple way, a Prime number is a number that cannot be made by multiplying other numbers. So 4 is Not Prime because we can say that 4 = 2 x 2, 6 is Not Prime because it can be produced by multiplying 3 x 2; but 5 Is Prime because we can’t find any integer numbers that can produce 5.
Numbers such as 1, 3, 5, 7, 11, 13 … all are Prime Numbers.
This function will ask the user to write a number then we will examine it to see whether it is a prime or not.
The Code:
num=int(input(“Enter a number: “))
def is_prime(num):
result=”Prime”
for t in range (2,num):
if num%t==0 :
result=”Not Prime”
break
return result
print num,’is’,is_prime(num)
Python Project: Fibonacci Numbers
Python: Fibonacci Numbers
Even Fibonacci Numbers
Fibonacci Sequence is generated by adding the previous two terms, so the N number in the sequence will be Xn=(Xn-1) + (Xn-2). Example: by starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, …
The Task: Get the Fibonacci sequence range from the user and count how many even valued terms is there. The user range should not be more than 10000 number.
The Code:
def get_Fibonacci_Sequence(rfrom,rto):
n1=rfrom
n2=rfrom+1
count=0
for x in range (rfrom,rto):
fab=n1+n2
n1=n2
n2=fab
# Check if the fab is even, the increment the counter
if fab%2==0 :
count =count +1
# After finish print the output
print”Between”,rfrom,” and “,rto,” there is “,count,”even Fibonacci number.”
range_ok =”no”
while range_ok==”no”:
print(‘Your range must be less than 10,000:’)
# Get the numbers from the user.
rfrom=int(input(‘Enter the range From:’))
rto=int(input(‘Enter the range To:’))
# Check if the numbers are less than 10000
if (rto – rfrom) < 10000 : range_ok ="yes"
#Call the function
get_Fibonacci_Sequence(int(rfrom),int(rto))
Python Project: Pluralise a Word
Python: Pluralise a Word
Loop through a dictionary and pluralise a word
One of Python Exercises on @PyBites codechalleng is to loop through a given dictionary of people and the number of games they’ve won then print out the users name and how many games they’ve won in the following format: “sara has won n games” and pluralise the word game to suit the number of games won.
we assume the dictionary is games_won = dict={‘sara’:0, ‘bob’:1, ‘tim’:5, ‘julian’:3, ‘jim’:1}
The Code:
games_won ={‘sara’:0, ‘bob’:1, ‘tim’:5, ‘julian’:3, ‘jim’:1}
def print_game_stats(games_won):
for key,val in games_won.items():
print(“{} has won {}{p}”.format(key, val,p=” game” if val ==1 else ” games” ))
print_game_stats(games_won)
Python Project: Sum N Numbers
Python: Sum N Numbers
Bites of Python exercises
I found this Python Exercises on the at PyBites codechalleng and i love the idea of solving problems and this will let me learn more, so thanks guys @pybites.
So this time the challenge is to Write a function that can sum up N numbers. The function should receive a list of N numbers, If no argument is provided, return sum of numbers 1..100.
I hope i did this right, here is my function; the result seems to be fine i am still learning so … sorry if i misunderstood.
def sum_up(my_nums=range(1,100)):
total=0
print”The List of number/s “,my_nums
for x in range (len(my_nums)):
total=total+int(my_nums[x])
print”Total is:”,total
print(“This function will sum up a given list of numbers.\nWhen you finish typping the numbers just press “”Enter””\nIf you did not enter any numbers i will assume the list is [1,100]”)
#Get the list from the user
n=input(“Type the numbers:”)
#In case the user enter some spaces in his number, we should remove it
the_n=n.replace(” “, “”)
#Here we are calling the functin
sum_up() if the_n ==”” else sum_up(the_n)
Python project: Drawing with Python – Flower
Python: Draw Flower
Drawing with Python
In this post i tried to draw another flower using arcs of circles, i get a simple one and i guess with more sizes we can do more complex shape.
You can play with the code and change the numbers, size and rotation degree and let’s see what we will have.
t = turtle.Turtle()
t.hideturtle()
t.pendown()
for x in range (30):
t.circle(60,70)
if x %3==0:
t.circle (10,90)
Python Project: Binary Search
Python: Binary Search
Binary Search
Definition:
Binary Search is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array.
In this code we are writing a Python code to find the target in a sorted given array and get its position without using any python math packages.
The case: We have an Array (arr=[2,3,5,6,8,10,11,13,15,16,19]) our target is 13, so we want the position of 13.
We are setting the first position as (pos_s=0) and the end position as (pos_e= the length of the array -1) and we will use recursive function.
Recursive Function: is a computer function or procedure that calling it self
The Code:
arr=[2,3,5,6,8,10,11,13,15,16,19]
target=11
pos_s =0
pos_e=int(len(arr)-1)
midarr =0
def bsearch(arr,target,pos_s,pos_e):
midarr=(pos_s+pos_e)/2
if arr[midarr] < target:
pos_s = midarr +1
bsearch(arr,target,pos_s,pos_e)
elif arr[midarr] > target:
pos_e = midarr -1
bsearch(arr,target,pos_s,pos_e)
elif arr[midarr] == target:
print(‘The target was: ‘,target, ‘ The key of our target is: ‘,midarr)
return
print(arr)
# Call the functin
bsearch(arr,target,pos_s,pos_e)
Python Project: Armstrong Numbers
Python: Armstrong Numbers
Check for Armstrong number in a range
In our last post (‘Check if a Number is Armstrong‘) we wrote a codes to check a given number and see whether it is an Armstrong or Not.
Today, we want to go through a set of numbers and see how many Armstrong numbers are there.
Before calling the ‘armstrong_in_range()’ and just to keep the code as less as we can, I assume the two numbers has the same number of digits, also I am getting the power (p) and the range numbers (n1, n2) out-side of this function and passing all as variables.
def armstrong_in_range(p,n1,n2):
my_sum = 0
count = 0
for num in range (n1,n2):
tot=num
for arm in range(p):
my_sum = my_sum + ((num % 10)**p)
num = num // 10
if my_sum == tot:
print(‘\nThe number {} is Armstrong.’.format(tot))
my_sum=0
count = count +1
else:
my_sum=0
print(‘\nWe have {} armstrong number(s)’.format(count))
Python Project: IF N an Armstrong
Python: Armstrong Numbers
Check if a Number is Armstrong
In late nineties, I was programming using Pascal Language and I was very passionate to convert some mathematical syntax into codes to fine the result, although some of them were very easy; but the goal was to write the codes.
Today, we are attempted to write a code in Python to check whether a number is an Armstrong or Not. First let’s ask:what is Armstrong number?Answer: If we assume we have a number (num = 371), 371 is an Armstrong because the sum of each digits to the power of (number of the digits) will be the same. That’s mean 371 is a three digits so the power (p=3) so:
3**3 = 27
7**3 = 343
1**3 = 1
then (27+343+1) = 371. … So 371 is an Armstrong Number.
In wikipedia:
Armstrong also known as a pluperfect digital invariant (PPDI) or the Narcissistic number is a number that: the sum of its own digits each raised to the power of the number of digits equal to the number its self.
# Function to check whether a number is Armstrong or Not.
def is_it_armstrong(num):
p= len(str(num)) # First: we get the power of the number
my_sum=0
tot=num
for x in range (p) :
my_sum=my_sum+((num%10)**p)
num=num//10
if my_sum == tot:
print(‘\nThe number {} is Armstrong.’.format(tot))
else :
print(‘\nThe number {} is NOT Armstrong.’.format(tot))
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... 