#include#includevoid main(){long int n,r,m,max=0,count=0;clrscr();printf("Enter the Number:");scanf("%ld",&n);m=n;while(n>0){r=n%10;if(r>max)max=r;n=n/10;}printf("\nLargest Digit is = %ld",max);while(m>0){r=m%10;if(r==max)count++;m=m/10;}printf("\n\nOccurence of Largest Digit %ld is = %ld",max,count);getch();}output:Enter the Number:68596999Largest Digit is = 9Occurence of Largest Digit 9 is = 4
program that take three decimal number as input and find the largest among them in assembly language
int i, largest=0;do { scanf ("Enter a number (0 to exit): %d", i); if (i>largest) largest=i; } while (i!=0); printf ("Largest number is: %d\n", largest);
helicopter
160 and 192.
It is 99,899,999.
The largest four digit whole number that is a multiple of 7 is 9,996.Find the largest four digit number : 9999Divide 9999 by 7Round the answer down to the nearest whole numberMultiply the answer from #3 by 7
To find that, simply take your largest 8-digit number: 99999999 And subtract your largest 7-digit number: 9999999 That leaves you with 90000000, or ninety-million.
To find the largest 2-digit number that is a factor of 3375, we need to factorize 3375 into its prime factors. 3375 can be expressed as 3^3 * 5^3. To find the largest 2-digit number that is a factor, we need to consider the factors that are multiples of both 3 and 5. The largest 2-digit number that fits this criteria is 75, which is 3 * 5^2.
syntax error
Assuming you do not want a number with leading zeros, the difference is 8999.
To find the largest three-digit even number using the digits 3, 4, and 5, you need to arrange these digits in descending order to maximize the number, ensuring that the last digit is even. The largest possible even number is 542
The smallest two-digit composite number is 10, which is the product of 2 and 5. The largest two-digit composite number is 99, which is the product of 3 and 33. To find the sum of the smallest and largest two-digit composite numbers, we add 10 and 99, resulting in 109.
#include<stdio.h> #include<conio.h> main() { int n,max=0,rem; printf("\n enter a number"); scanf("%d",&n); while(n!=0) { rem=n%10; n=n/10; if(rem>max) { max=rem: }} printf("\n the largest digit is: %d",max); getch(); }
find the diagonal method of two digit number and three digit number
906609=913*993 I found this using a relatively simple computer program that I wrote.
Write your own prime number program and find out.