Source Code:-
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ''' | |
| Created on 19-Aug-2019 | |
| @author: Anonymous | |
| ''' | |
| #PF-Assgn-43 | |
| def find_factors(num): | |
| #Accepts a number and returns the list of all the factors of a given number | |
| factors = [] | |
| for i in range(1,(num+1)): | |
| if(num%i==0): | |
| factors.append(i) | |
| return factors | |
| def find_smallest_number(num): | |
| i=int(1) | |
| while(True): | |
| x=find_factors(i) | |
| if(len(x)==num): | |
| print(x) | |
| break | |
| else: | |
| i=i+int(1) | |
| return x[-1] | |
| #start writing your code here | |
| num=16 | |
| print("The number of divisors :",num) | |
| result=find_smallest_number(num) | |
| print("The smallest number having",num," divisors:",result) |
Great solution, Keep Posting.
ReplyDelete// Solution in JAVA programming language
ReplyDeletepackage tcsNqtPractice;
import java.util.Scanner;
public class Assignment44 {
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
System.out.println("Enter the Number: ");
int num = scan.nextInt();
int value = 2;
int rem = 0;
while(true) {
rem = noOfDivisors(value);
if(rem == num) {
System.out.println("The No. with divisors: "+ value);
break;
}else {
value = value + 1;
}
}
}
public static int noOfDivisors(int n) {
int count = 0;
for(int i=1; i<=n; i++) {
if(n%i == 0) {
count ++;
}
}
return count;
}
}