How many 4-permutations of the positive integers not exeeding 100 contain three consecutive integers

Lucian Maddox 2022-07-02 Answered
How many 4-permutations of the positive integers not exeeding 100 contain three consecutive integers k, k + 1 , k + 2, in the correct order
a) where these consecutive integers can perhaps be separated by other integers in the permutation?
b) where they are in consecutive positions in the permutation?
We know that the number of permutations with repetition for a is 98 97 4 since for every 98 possible choices of k we have 97*4 possible 4-permutations, (arrangements) of k, k + 1 , k + 2 and another number different from those 3.
But how can I compute the repreated permutations?
For instance, consider k = 1. Then some of the possible permutations are "1,2,3,4","4,1,2,3","1,4,2,3" which are also permutations for k = 2. I think that given a number k I should find the 4-permutations of k that are repeated in other permutations. Then i will need to multiply this value for 98, the number of total possible Ks and subtract this from the first result. But I do not know how can I compute them.
Sorry if the question has already been made, but my point of interest regards how to find the repetitions I am interested in.
You can still ask an expert for help

Want to know more about Discrete math?

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

Alexzander Bowman
Answered 2022-07-03 Author has 19 answers
Step 1
There are 98 ways to choose k, the smallest of the three consecutive integers and 97 ways to choose a fourth integer from the set of positive integers not exceeding 100. There are four ways to place the integer which is not among k , k + 1 , k + 2 within the 4-permutation. This would appear to yield 98 97 4 admissible permutations.
However, we have counted each of the 97 permutations of four consecutive increasing integers twice.
Step 2
Let's examine your example of the first four positive integers. If k = 1, the admissible permutations of { 1 , 2 , 3 , 4 } are (1,2,3,4), (1,2,4,3), (1,4,2,3), (4,1,2,3) since 1,2,3 must appear in the correct order. If k = 2, the admissible permutations of { 1 , 2 , 3 , 4 } are (1,2,3,4), (2,1,3,4), (2,3,1,4), (2,3,4,1) since 2,3,4 must appear in the correct order. Notice that the only common permutation for this set of numbers is (1,2,3,4).
Thus, the number of admissible permutations is 98 97 4 97.

We have step-by-step solutions for your answer!

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2020-11-09
Use proof by Contradiction to prove that the sum of an irrational number and a rational number is irrational.
asked 2021-07-28

Let A, B, and C be sets. Show that (AB)C=(AC)(BC)
image

asked 2021-08-18
Discrete Mathematics Basics
1) Determine whether the relation R on the set of all Web pages is reflexive, symmetric, antisymmetric, and/or transitive, where (a,b)R if and only if
I) everyone who has visited Web page a has also visited Web page b.
II) there are no common links found on both Web page a and Web page b.
III) there is at least one common link on Web page a and Web page b.
asked 2021-08-15
How many elements are in the set { 0, { { 0 } }?
asked 2022-05-21
A box contains 20 green balls and 25 red balls. Two balls are chosen at random, one after the other, without replacement?
i. What is the probability that both balls are red?
ii. What is the probability that the second ball is red but the first ball is not?
iii. What is the probability that the second ball is green?
asked 2021-08-03

A 5-card hand is dealt from a perfectly shuffled deck of playing cards. What is the probability that the hand is a full house? A full house has three cards of the same rank and another pair of the same rank. For example, {4, 4, 4, J, J}

asked 2022-07-16
Discrete math - Prove that a tree with n nodes must have exactly n 1 edges? I have researched the solution but I haven't founded yet. I know of course, a tree with n nodes must have exactly n 1 edges. But, I can't prove it.

New questions

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question