Added python code for problems in math section

Author: hardikrana11

Math/All factors of a given Number/Python/All factors of a given Number.py

@@ -0,0 +1,22 @@
+"""
+         Print all factors of a given number
+
+"""
+
+#Enter your number
+num = input("Enter a number: ");
+#initialize your count as 0
+count = 0;
+number = int(num);
+#run a loop to find factors
+#Check the factors (starting with 2, until the number is reached)
+for i in range(2, number-1):
+    #If the divided number has 0 as the division reminder, it'll be a factor
+    if number%i == 0:
+        #Print this number everytime
+        print(i);
+        i += 1;
+        count += 1;
+#If number is not divisible by any number other than 1 and number itself,then it is prime
+if count==0:
+    print(number,"is a prime number.");

Math/AllPermutations/Python/AllPermutations.py

@@ -0,0 +1,11 @@
+"""
+         Print all permutations of a given list
+
+"""
+
+#We can do it by built-in permutation function in itertools library
+#import the itertools library
+import itertools
+#call the permutation function of itertools library and pass list numbers as a argument
+#this will print the list of permutations
+print(list(itertools.permutations([1, 2, 3])))

Math/NextPow2/Python/nextpow2.py

@@ -0,0 +1,21 @@
+"""
+         Print next power of 2 for a given number
+
+"""
+#import the math library
+import math
+#function which calculates the nextpow of 2
+def nextpow(x):
+    #this would give us the power P , such that 2 ^ P = X.
+    #ceil function to get the next number
+    nextnum = float(math.ceil(math.log(x,2)))
+    #2 ^ next number will be the required result.
+    result = float(pow(2.0,nextnum))
+    return  int(result)
+
+#Enter your number
+num = int(input("Enter a number: "))
+#call a function
+ans = nextpow(num)
+#print answer
+print(ans)

Math/Randomized algorithms/ Random_Number_Selection_from_Array.cpp renamed to Math/Randomized algorithms/Random_Number_Selection_from_Array.cpp

@@ -0,0 +1,19 @@
+"""
+            Tower Of Hanoi
+
+"""
+#MoveTower function which uses recursion
+def moveTower(height,fromPole, toPole, withPole):
+    if height >= 1:
+        moveTower(height-1,fromPole,withPole,toPole)
+        moveDisk(fromPole,toPole)
+        moveTower(height-1,withPole,toPole,fromPole)
+
+#Printing the movements of disks
+def moveDisk(fp,tp):
+    print("moving disk from",fp,"to",tp)
+
+#Enter number of disks
+n = int(input("Enter number of disks "))
+#call the function
+moveTower(n,"A","B","C")

Math/TowerofHanoi/Python/TowerOfHanoi.py

@@ -0,0 +1,30 @@
+// A C++ program to find floor(sqrt(x) using binary search
+#include<bits/stdc++.h>
+using namespace std;
+
+// Returns floor of square root of x
+int floorSqrt(int x)
+{
+    // Base cases
+    if (x == 0 || x == 1)
+    return x;
+
+    // Staring from 1, try all numbers until
+    // i*i is greater than or equal to x.
+    int i = 1, result = 1;
+    while (result <= x)
+    {
+      i++;
+      result = i * i;
+    }
+    return i - 1;
+}
+
+int main()
+{
+	int x;
+	cout<<"Enter a number"<<endl;
+	cin>>x;
+	cout << "The floor square root of an integer is "<< floorSqrt(x) << endl;
+	return 0;
+}