Counting Unique 7-Digit Phone Numbers - No Repeats

  • Thread starter Thread starter THA
  • Start date Start date
  • Tags Tags
    Counting Numbers
AI Thread Summary
The discussion revolves around calculating the number of unique 7-digit phone numbers in the format NXX-XXXX, where N must be between 2 and 9, and no digits can repeat. Participants explore various approaches, including using permutations to determine total combinations and subtracting those that start with invalid digits (0 or 1). There is uncertainty about how to accurately count valid combinations while adhering to the constraints on the first digit. The conversation emphasizes the importance of correctly applying permutation principles to achieve the desired count. Overall, the goal is to find the total unique phone numbers without repeating any digits.
THA
Messages
4
Reaction score
0
Problem details:
Given a 7 digit phone number in the form: NXX - XXXX
N = a number from 2-9
X = a number from 0-9
how many with no repeated digits?

I think if I pretend that N is also a number from 0-9, then there would be P(10, 7) numbers without repeats, but then that's too much and I'm not sure how I can subtract the number's that N is not supposed to have. The other way I was thinking is the last 6 numbers can be chosen P(10, 6) without repeat's but then I'm not sure how I can choose the number of N. Can someone provide some help?
 
Physics news on Phys.org
How many single digit numbers with no repeated digits?
What about two, three, four etc.?

Also, it might be easier to figure out how many possible 7 digit numbers there are, and then subtract off the ones starting with 0 or 1.
 
How many single digit numbers with no repeated digits?
It's regular 7-digit phone number, none of the 7 digit's can repeat. If that's not what you meant, then please clarify.

Also, it might be easier to figure out how many possible 7 digit numbers there are, and then subtract off the ones starting with 0 or 1.
That's what I was thinking, but I'm not really sure how to count the number's that start with 0 or 1. Would it be something like: P(10,7) - 2*P(10,6) ?
 
Here's what NateTG means : Forget for now that you have a 7 digit number and look at the following.

How many ways of finding a 1-digit number ? That's easy : 10 ways. Any number from 0..9 can be used.
How many 2-digit numbers without repeats ? Okay, I can put any of the10 numbers in the ten's place, and having used up this number, I can put any of the remaining 9 numbers in the unit's place. So there's 90 possibilities or P(10,2)
In this 2-digit number, if the ten's digit had to be only one of 2..9, I can fill that spot in 8 ways, and the units spot in...still only 9 ways.

And so on...
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top