From 1c004b020eb43ac60d08b332b38275a5984bb870 Mon Sep 17 00:00:00 2001 From: Dipesh Gupta Date: Wed, 7 Oct 2020 19:07:02 +0530 Subject: [PATCH 1/6] smallestK-digitdivbyX # Python code to find smallest K-digit # number divisible by X --- smallestK-digitdivbyX | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 smallestK-digitdivbyX diff --git a/smallestK-digitdivbyX b/smallestK-digitdivbyX new file mode 100644 index 0000000..c42c2ba --- /dev/null +++ b/smallestK-digitdivbyX @@ -0,0 +1,17 @@ +def sumOfSeries(num): + + # Computing MAX + res = 0 + fact = 1 + + for i in range(1, num+1): + fact *= i + res = res + (i/ fact) + + return res + + +n = 5 +print("Sum: ", sumOfSeries(n)) + +# Code contributed by Mohit Gupta_OMG <(0_o)> From a2ae20d0b01ac4dfab97fc0bbb65954df6eff160 Mon Sep 17 00:00:00 2001 From: Dipesh Gupta Date: Wed, 7 Oct 2020 19:15:00 +0530 Subject: [PATCH 2/6] AbundantNumber An Optimized Solution to check Abundant Number in PYTHON --- AbundantNumber | 47 +++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 AbundantNumber diff --git a/AbundantNumber b/AbundantNumber new file mode 100644 index 0000000..07690f0 --- /dev/null +++ b/AbundantNumber @@ -0,0 +1,47 @@ +import math + +# Function to calculate sum of divisors +def getSum(n) : + sum = 0 + + # Note that this loop runs till square root + # of n + i = 1 + while i <= (math.sqrt(n)) : + if n%i == 0 : + + # If divisors are equal,take only one + # of them + if n/i == i : + sum = sum + i + else : # Otherwise take both + sum = sum + i + sum = sum + (n / i ) + i = i + 1 + + # calculate sum of all proper divisors only + sum = sum - n + return sum + +# Function to check Abundant Number +def checkAbundant(n) : + + # Return true if sum of divisors is greater + # than n. + if (getSum(n) > n) : + return 1 + else : + return 0 + +# Driver program to test above function */ +if(checkAbundant(12) == 1) : + print "YES" +else : + print "NO" + +if(checkAbundant(15) == 1) : + print "YES" +else : + print "NO" + +# This code is contributed by Nikita Tiwari. From f44598b9e325d166b3a223e40a0c00e598bb8e5b Mon Sep 17 00:00:00 2001 From: Dipesh Gupta Date: Wed, 7 Oct 2020 19:19:55 +0530 Subject: [PATCH 3/6] SieveOfEratosthenes Python program to print all primes smaller than or equal to n using Sieve of Eratosthenes --- SieveOfEratosthenes | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 SieveOfEratosthenes diff --git a/SieveOfEratosthenes b/SieveOfEratosthenes new file mode 100644 index 0000000..eb69585 --- /dev/null +++ b/SieveOfEratosthenes @@ -0,0 +1,28 @@ +def SieveOfEratosthenes(n): + + # Create a boolean array "prime[0..n]" and initialize + # all entries it as true. A value in prime[i] will + # finally be false if i is Not a prime, else true. + prime = [True for i in range(n+1)] + p = 2 + while (p * p <= n): + + # If prime[p] is not changed, then it is a prime + if (prime[p] == True): + + # Update all multiples of p + for i in range(p * p, n+1, p): + prime[i] = False + p += 1 + + # Print all prime numbers + for p in range(2, n+1): + if prime[p]: + print p, + +# driver program +if __name__=='__main__': + n = 30 + print "Following are the prime numbers smaller", + print "than or equal to", n + SieveOfEratosthenes(n) From 64e3b68a1a34ebc2135930c81065dd21bd1b60a0 Mon Sep 17 00:00:00 2001 From: Dipesh Gupta Date: Wed, 7 Oct 2020 19:50:24 +0530 Subject: [PATCH 4/6] SimpleCalculator Python program for simple calculator --- SimpleCalculator | 46 ++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 SimpleCalculator diff --git a/SimpleCalculator b/SimpleCalculator new file mode 100644 index 0000000..82b8e56 --- /dev/null +++ b/SimpleCalculator @@ -0,0 +1,46 @@ +# Function to add two numbers +def add(num1, num2): + return num1 + num2 + +# Function to subtract two numbers +def subtract(num1, num2): + return num1 - num2 + +# Function to multiply two numbers +def multiply(num1, num2): + return num1 * num2 + +# Function to divide two numbers +def divide(num1, num2): + return num1 / num2 + +print("Please select operation -\n" \ + "1. Add\n" \ + "2. Subtract\n" \ + "3. Multiply\n" \ + "4. Divide\n") + + +# Take input from the user +select = int(input("Select operations form 1, 2, 3, 4 :")) + +number_1 = int(input("Enter first number: ")) +number_2 = int(input("Enter second number: ")) + +if select == 1: + print(number_1, "+", number_2, "=", + add(number_1, number_2)) + +elif select == 2: + print(number_1, "-", number_2, "=", + subtract(number_1, number_2)) + +elif select == 3: + print(number_1, "*", number_2, "=", + multiply(number_1, number_2)) + +elif select == 4: + print(number_1, "/", number_2, "=", + divide(number_1, number_2)) +else: + print("Invalid input") From ab883e4a84ff13242c40f3595764ffeb4b3eea78 Mon Sep 17 00:00:00 2001 From: Dipesh Gupta Date: Sat, 2 Oct 2021 15:39:16 +0530 Subject: [PATCH 5/6] PrimeOrNot Program To Find If the number is prime or not --- PrimeOrNot | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 PrimeOrNot diff --git a/PrimeOrNot b/PrimeOrNot new file mode 100644 index 0000000..1f85fcf --- /dev/null +++ b/PrimeOrNot @@ -0,0 +1,25 @@ +# Program to check if a number is prime or not + +num = 29 + +# To take input from the user +#num = int(input("Enter a number: ")) + +# define a flag variable +flag = False + +# prime numbers are greater than 1 +if num > 1: + # check for factors + for i in range(2, num): + if (num % i) == 0: + # if factor is found, set flag to True + flag = True + # break out of loop + break + +# check if flag is True +if flag: + print(num, "is not a prime number") +else: + print(num, "is a prime number") From 7ed684d65520f4bc1cd7f7cf5accac3c92714422 Mon Sep 17 00:00:00 2001 From: Dipesh Gupta Date: Sat, 2 Oct 2021 16:04:38 +0530 Subject: [PATCH 6/6] arm armstrong or not --- arm | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 arm diff --git a/arm b/arm new file mode 100644 index 0000000..a988381 --- /dev/null +++ b/arm @@ -0,0 +1,20 @@ +# Python program to check if the number is an Armstrong number or not + +# take input from the user +num = int(input("Enter a number: ")) + +# initialize sum +sum = 0 + +# find the sum of the cube of each digit +temp = num +while temp > 0: + digit = temp % 10 + sum += digit ** 3 + temp //= 10 + +# display the result +if num == sum: + print(num,"is an Armstrong number") +else: + print(num,"is not an Armstrong number")