a number whose only prime factors are 2,3,5, and 7 is call humble number,,write

a number whose only prime factors are 2,3,5, and 7 is call
humble number,,write a program to find and display the nth
element in this sequence..

sample input : 2,3,4,11,12,13, and 100.. sample output : the
2nd humble number is 2,the 3rd humble number is 3,the 4th
humble number is ,the 11th humble number is 12, the 12th
humble number is 14, the 13th humble number is 15, the 100th
humble number is 450.

Question Posted / hmmm

1 Answers
5179 Views
I also Faced
E-Mail Answers

a number whose only prime factors are 2,3,5, and 7 is call humble number,,write a program to find a..

Answer / Suresh Meena

Here's a C program to find and display the nth humble number:n```cn#include <stdio.h>nnint count_humble(int num, int humbles[], int len){ // Function to count humble numbers up to 'num'n int count = 0;n for (int i = 0; i < len; i++){n if ((humbles[i] & (humbles[i] - 1)) == humbles[i]) {n count++;n if (humbles[i] > num) break;n }n }n return count;n}nnint main(void){n int humbles[] = {2, 3, 5, 7}; // Humble numbersn int len = sizeof(humbles) / sizeof(humbles[0]); // Length of the arrayn int n; // User input for nth humble numbern printf("Enter the nth humble number you want to find: ");n scanf("%d", &n);n if (n > count_humble(humbles[len-1], humbles, len)) {n printf("The requested humble number does not exist in the sequence.
");n return 0;n }n int i = 0;n for (int j = 0; j < n - 1; j++) {n while ((humbles[i] & (humbles[i] + 1)) != humbles[i]) i++;n }n printf("The %dth humble number is: %d
", n, humbles[i]);n return 0;n}n```

Is This Answer Correct ?

0 Yes

0 No

Post New Answer