Register to reply

Permutation Question.

by forevergone
Tags: permutation
Share this thread:
Dec15-05, 06:11 PM
P: 49
The question is:

A sequence of length 6 is formed from the digits {0,1,2...9}. If no repetition is allowed, how many of these sequences can be formed if:

f) the sum of the first two terms is 7?

So i set up my place holders:

_ _ _ _ _ _

if the first 2 place holders have a sum of 7, are there 8 possibilities for each place holder because 0+1, 1+6, 2+5, 3+4, 4+3, 5+2, 6+1, 7+0? Or would there be 4 for each consisting only of 0+1, 1+6, 2+5, 3+4? So really teh answer would be 16 x 8P4 or 64 x 8P4?

The answer was 13440, but I don't see why.
Phys.Org News Partner Science news on
Fungus deadly to AIDS patients found to grow on trees
Canola genome sequence reveals evolutionary 'love triangle'
Scientists uncover clues to role of magnetism in iron-based superconductors
Dec15-05, 07:26 PM
P: 17,220
You are right on the right track. There are 8 possibilities for the first digit (0-7). Once that is picked the second digit is determined. That leaves 8 possible digits for the third, 7 possible for the fourth, 6 possible for the fifth, and 5 possible for the sixth.

Dec17-05, 04:37 PM
P: 49
I see, ok.


Register to reply

Related Discussions
Conjugation of a permutation by a permutation in a permutation group Calculus & Beyond Homework 3
Permutation question Precalculus Mathematics Homework 2
Puzzle / Permutation question? Set Theory, Logic, Probability, Statistics 15
Question on permutation. Precalculus Mathematics Homework 4
Another Permutation Question Linear & Abstract Algebra 1