answersLogoWhite

0


Best Answer

This is a question of permutations; the answer is equal to the factorial of 5 (number of digits) divided by the factorial of 3 (number used in each selection), written 5! / 3!. This equals 120 / 6, or 20 ways.

User Avatar

Wiki User

11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: How many ways are there to write a 3 digit positive integer using digits 1 3 5 7 and 9 if no digit is used more than once?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

How may ways are there to write 3 digit positive integer using 123456789 digits?

9*9*9 = 729 ways.


How many ways are there to write a 3-digit positive integer using digits 1 3 5 7 and 9 if no digit is used more than once?

There are 5 digits, and if none can be repeated then the first digit can be chosen in 5 ways, the second can be chosen in 4 ways and the third in 3. 5 x 4 x 3 = 60.


What is the smallest number you can make using the digits 5 7 3 and 1?

The smallest positive integer is 1357.


In java How do you have a method take in an int value and return an int containing sum of the individual digits in the number using a recursive method?

Add the last digit plus the sum of all the previous digits. The base case is that if your integer only has a single digit, just return the value of this digit. You can extract the last digit by taking the remainder of a division by 10 (number % 10), and the remaining digits by doing an integer division by 10.


How do you write a visual basic program to sum the odd number digits of a 12 digit code using division and Mod and while loops?

Function sum_odd_digits(ByVal number As Integer) As Integer Dim digit As Integer sum_odd_digits = 0 While number <> 0 digit = number Mod 10 If digit And 1 Then sum_odd_digits = sum_odd_digits + digit number = number / 10 End While End Function


How many odd 3 digit positive integers can be written using the digits 2 and 3 and 4 and 5 and 6?

Fifty


What is the greatest seven-digit number using four different digits?

9,999,876 is the greatest seven-digit number using four different digits.


What are the the 3 digit numbers using 1345678?

Using the digits of 1345678, there are 210 three digit numbers in which no digit is repeated.


Have 1 of each of these digits 1p 2p 5p 10p 20p how many sums can you make using these digits?

10p is not a digit. A digit is an integer in the range 0-9. Leaving that aside, you can make 31 sums from the 5 coins. If you allow 0 as a valid sum, the answer is 32.


What is the smallest 6-digit number having different digits?

It is -987654. The smallest POSITIVE number is 102345.


What is the smallest 6 digit number using the digits 12345?

Since there are only five different digits, a 6-digit number can only be generated if a digit can be repeated. If digits can be repeated, the smallest 6-digit number is 111111.


A 5 digit positive integer is entered through the keyboard how to write a function in C to calculate sum of digits of the 5 digits number by using recursion and without using recursion?

#include <stdio.h> int digit_sum(int); int digit_sum_rec(int); main() { int num; printf("Enter 5 digit positive integer. : "); scanf("%d",&num); printf("The sum of the digits is: %d\n",digit_sum(num)); printf("The sum of the digits is (calculated recursively): %d\n", digit_sum_rec(num)); } int digit_sum(int n) { int t=0; while(n) { t+=n%10; n/=10; } return t; } int digit_sum_rec(int n) { if(n==0) return 0; return (n%10)+digit_sum_rec(n/10); }