## Blog Pages

### Program for Find sum of even factors of a number

import math

def sumofFactors(n) :

if (n % 2 != 0) :

return 0

res = 1

for i in range(2, (int)(math.sqrt(n)) + 1) :

count = 0

curr_sum = 1

curr_term = 1

while (n % i == 0) :

count= count + 1

n = n // i

if (i == 2 and count == 1) :

curr_sum = 0

curr_term = curr_term * i

curr_sum = curr_sum + curr_term

res = res * curr_sum

if (n >= 2) :

res = res * (1 + n)

return res

n = 18

print(sumofFactors(n))

### Program for Legendre\’s Conjecture

import math

def isprime( n ):

i = 2

for i in range (2, int((math.sqrt(n)+1))):

if n%i == 0:

return False

return True

def LegendreConjecture( n ):

print ( "Primes in the range ", n*n

, " and ", (n+1)*(n+1)

, " are:" )

for i in range (n*n, (((n+1)*(n+1))+1)):

if(isprime(i)):

print (i)

n = 50

LegendreConjecture(n)

### Design with turtle

import turtle

turtle.speed(0)

turtle.bgcolor("black")

for i in range(15):

for colours in ("red", "magenta", "yellow", "orange", "blue", "green", "purple"):

turtle.color(colours)

turtle.pensize(3)

turtle.left(4)

turtle.forward(200)

turtle.left(90)

turtle.forward(200)

turtle.left(90)

turtle.forward(200)

turtle.left(90)

turtle.forward(200)

turtle.left(90)

### Counter to find the size of largest subset of anagram words

from collections import Counter

def maxAnagramSize(input):

input = input.split(" ")

for i in range(0,len(input)):

input[i]=''.join(sorted(input[i]))

freqDict = Counter(input)

print (max(freqDict.values()))

if __name__ == "__main__":

input = 'ant magenta magnate tan gnamate'

maxAnagramSize(input)

### program to count Even and Odd numbers in a List Using Python Lambda Expressions

list1 = [10, 21, 4, 45, 66, 93, 11]

odd_count = len(list(filter(lambda x: (x%2 != 0) , list1)))

even_count = len(list(filter(lambda x: (x%2 == 0) , list1)))

print("Even numbers in the list: ", even_count)

print("Odd numbers in the list: ", odd_count)

### Break a list into chunks of size N

my_list = ['python', 'for', 'engineers', 'like',

'complete','solution', 'for', 'python',

'related','queries']

def divide_chunks(l, n):

for i in range(0, len(l), n):

yield l[i:i + n]

n = 5

x = list(divide_chunks(my_list, n))

print (x)

### Matrix creation of n*n Using next() + itertools.count()

import itertools

N = 4

print("The dimension : " + str(N))

temp = itertools.count(1)

res = [[next(temp) for i in range(N)] for i in range(N)]

print("The created matrix of N * N: " + str(res))

### Program for Find remainder of array multiplication divided by n

from functools import reduce

def find_remainder(arr,n):

sum_1=reduce(lambda x,y: x*y,arr)

remainder=sum_1%n

print(remainder)

arr=[100,10,5,25,35,14]

n=11

find_remainder(arr,n)

### Reconstruct the array by replacing arr[i] with (arr[i-1]+1) % M

def construct(n, m, a):

ind = 0

for i in range(n):

if (a[i]!=-1):

ind = i

break

for i in range(ind-1, -1, -1):

if (a[i]==-1):

a[i]=(a[i + 1]-1 + m)% m

for i in range(ind + 1, n):

if(a[i]==-1):

a[i]=(a[i-1]+1)% m

print(*a)

n, m = 6, 7

a =[5, -1, -1, 1, 2, 3]

construct(n, m, a)

### Program for Number of stopping station problem

def stopping_station( p, n):

num = 1

dem = 1

s = p

while p != 1:

dem *= p

p-=1

t = n - s + 1

while t != (n-2 * s + 1):

num *= t

t-=1

if (n - s + 1) >= s:

return int(num/dem)

else:

return -1

num = stopping_station(4, 12)

if num != -1:

print(num)

else:

print("Not Possible")