Take GRE Mock Test Online

Explanation: This question focuses on arranging objects where some items are identical in appearance. The row contains a total of ten marbles, but the marbles of the same color cannot be distinguished from one another. In permutation problems like this, arranging all objects normally would count many repeated patterns multiple times. Therefore, adjustments are needed for repeated objects.

To understand the process, first think about arranging all ten marbles in every possible order. If every marble were unique, the total arrangements would be calculated using factorial notation. However, since three white marbles are identical, swapping them among themselves does not create a new arrangement. The same idea applies to the two black marbles and five pink marbles. Because of these repetitions, the repeated internal arrangements must be removed from the total count.

This type of problem belongs to permutations of non-distinct objects. Such concepts are widely used in probability, coding theory, and combinatorics. A similar example is arranging letters in a word where some letters repeat, such as “BALLOON,” where repeated letters reduce the number of unique patterns formed.

Explanation: This problem is based on arranging letters under a restriction. The word contains repeated as well as distinct letters, and the condition requires every vowel to remain together as one block. Whenever several letters must stay adjacent, they are temporarily treated as a single unit during arrangement.

The word MAHIMA contains vowels and consonants. Instead of arranging each vowel separately at first, the group of vowels is combined into one cluster. After grouping them, the cluster and the remaining consonants are arranged together. While doing this, attention must also be paid to repeated letters because exchanging identical letters does not produce a new arrangement.

After arranging the main blocks, the vowels inside the grouped block can also be rearranged among themselves. The final count depends on combining these two stages correctly. This approach is common in constrained permutation problems where certain elements must remain together or separated.

A simple analogy is seating family members together in a row at a function. First, the family is treated as one unit while arranging all guests, and later the family members rearrange themselves within their own group.

Explanation: This arrangement problem involves a restriction where people from the same category cannot sit side by side. Since there are four teachers and four students, the seating must follow an alternating pattern. Such Questions are common in permutation topics involving restrictions and ordered placement.

To begin, observe that if no two teachers and no two students may sit together, the row must alternate between teacher and student positions throughout. There are only two possible patterns for this arrangement: either a teacher occupies the first seat or a student occupies the first seat. Once a pattern is chosen, the individuals within each category can be arranged freely in their allotted positions.

The teachers can be permuted among their positions independently, and the students can also be permuted independently. Since both groups contain distinct individuals, factorial methods are used to count their arrangements. Finally, the counts obtained for both alternating patterns are combined.

A similar example is arranging black and white tiles in a straight line so that no two tiles of the same color touch each other. The structure becomes fixed first, and then individual placements are considered.

Explanation: This question deals with arranging letters under the condition that all vowels must remain adjacent. Such problems are solved using grouping methods in permutations. The key idea is to temporarily treat all vowels as one single unit while arranging the remaining letters.

The word ADVANCE contains both vowels and consonants, with one repeated letter. First, all vowels are combined into a single block. This block is then arranged together with the consonants as separate units. Since repeated letters exist in the word, repeated arrangements must be adjusted properly to avoid overcounting identical patterns.

After arranging the major units, the vowels inside their block can also change positions among themselves. Therefore, the calculation occurs in two stages: arranging the grouped units externally and arranging the vowels internally. Multiplication principle is then applied to combine both results.

This technique is commonly used in permutation problems where selected items must remain together. A similar situation occurs when friends insist on sitting together in a cinema row. The group is first treated as one entity, then individual positions inside the group are considered separately.

Explanation: This problem is based on arranging letters with repetition while ensuring that all occurrences of a particular letter remain together. In such permutation Questions, the repeated letters that must stay adjacent are treated as a single combined block during the initial arrangement process.

The word GORGENGEN contains repeated letters, including multiple G’s. To satisfy the condition, all G’s are grouped into one unit. This grouped block is then arranged with the remaining letters. Since several letters repeat in the word, factorial division is required to remove duplicate arrangements created by identical letters.

After creating the combined block of G’s, the total number of units decreases, simplifying the arrangement process. The repeated non-G letters must still be handled carefully because exchanging identical letters does not produce a unique arrangement. This is an important concept in permutations involving identical objects.

A comparable example is arranging books on a shelf where all books from the same series must stay together. The entire series is first treated as one large book, after which the rest of the arrangement is calculated.

Explanation: This probability question focuses on a specific toss within a sequence of independent coin tosses. In probability theory, each toss of a fair coin is independent, meaning the outcome of one toss does not affect the outcome of another toss.

The condition only concerns the fourth toss being a head. The results of the first, second, third, and fifth tosses are unrestricted and may produce either head or tail. Therefore, the total sample space contains all possible outcomes from five tosses, while the favorable outcomes are those where the fourth position specifically contains a head.

To solve such problems, it is helpful to think position-wise. Since each toss has two equally likely outcomes, fixing one position reduces uncertainty only for that particular toss. The remaining tosses continue to vary freely. This principle of independence is central to many probability models involving repeated trials.

An everyday analogy is flipping a Light switch five times and only caring whether the fourth action turns the Light on. The earlier and later actions do not influence the required condition.

Explanation: This question is based on the counting principle where choices are made under a restriction. The bride has limited choices for entry, and after entering, the exit must occur through a different door. Such problems are solved using systematic counting of available options.

First, determine the number of possible entry choices available to the bride. After selecting one entry door, the restriction immediately reduces the number of valid exit doors because the same door cannot be used again. The multiplication principle is then applied to combine the independent stages of entry and exit.

These problems are examples of ordered arrangements because entering through Door A and leaving through Door B is considered different from entering through Door B and leaving through Door A. Careful attention must therefore be paid to sequence and restrictions simultaneously.

A practical analogy is entering and leaving a stadium through different gates for crowd control. Once one gate is chosen for entry, the exit options automatically become limited by the given rule.

Explanation: This arrangement problem uses the multiplication principle to combine independent choices made by two individuals. The bride and bridegroom each have their own possible entry and exit selections, and the total number of arrangements depends on combining all valid possibilities.

The bride has restricted entry choices, while the bridegroom has freedom to use any of the available doors for both entry and exit. Since the actions of the two individuals are independent, the number of possibilities for one person is multiplied by the number of possibilities for the other person.

In such counting problems, it is important to identify each stage separately. First count the possible movements of the bride, then count the possibilities for the bridegroom, and finally combine them using multiplication. Ordered choices Matter because changing entry or exit doors creates a different arrangement.

This concept is similar to choosing travel routes where one person has limited station options while another can start and end from any station. The overall combinations increase by combining each person’s independent possibilities.

Explanation: This question involves counting arrangements under color-based restrictions. The hall contains doors of two colors, and the condition requires the entry and exit doors to belong to different color groups. Such problems are solved using case-based counting and the multiplication principle.

There are two possible scenarios. In the first scenario, the person enters through a red door and exits through a green door. In the second scenario, the person enters through a green door and exits through a red door. Each scenario is counted separately because the order of movement matters.

For each case, the number of choices for entry is multiplied by the number of available exit choices. After calculating both scenarios independently, their totals are added together to obtain the overall number of valid arrangements.

A comparable real-life example is entering a building through one category of gate and leaving through another category reserved for exits. The counting depends on pairing choices from different groups while respecting direction and order.

Explanation: This question is a permutation problem involving repeated letters. When letters repeat within a word, exchanging identical letters does not create a new arrangement. Therefore, the total arrangements must be corrected to avoid counting duplicate patterns multiple times.

The word SUCCEED contains several repeated letters. If all letters were unique, the total arrangements would simply depend on factorial calculation of all positions. However, because certain letters occur more than once, the repeated internal arrangements must be divided out appropriately.

The standard method is to calculate the factorial of the total number of letters and then divide by the factorials corresponding to repeated letters. This ensures that identical rearrangements are not counted separately. Such techniques are fundamental in combinatorics and appear frequently in competitive examinations.

A simple analogy is arranging colored balls where multiple balls share the same color. Swapping identical balls changes nothing visually, so those repeated patterns should not increase the count of unique arrangements.

Explanation: This problem involves forming numbers using repeated digits while ensuring that all digits are used. Since six digits are given, every arrangement automatically produces a six-digit number, which satisfies the condition of being greater than one lakh.

The main concept here is permutations of repeated objects. If all digits were distinct, the total number of six-digit arrangements would be found using factorial methods. However, the digit 7 appears multiple times and the digit 6 also repeats. Rearranging identical digits among themselves does not create new numbers.

Therefore, the total arrangements must be adjusted by dividing by factorials corresponding to the repeated digits. This avoids counting identical numerical patterns repeatedly. Such Questions commonly appear in topics related to counting principles, permutations, and number formation.

An everyday analogy is arranging identical colored cards to create codes. Even though the cards are physically swapped, the visible code remains unchanged if the swapped cards are identical.

Explanation: This question is a straightforward counting problem involving available choices. The bride is allowed to use only two specific doors for entry into the banquet hall. Since no additional restrictions are mentioned regarding exits or repeated use, the counting depends only on the permitted entry options.

In elementary counting theory, when a person can choose one option from a fixed SET of possibilities, the total number of ways equals the number of available choices. Here, the focus is simply on selecting one valid door among the permitted options.

Such problems introduce the foundation of the counting principle, where each independent choice contributes directly to the total count. Although simple, these concepts form the basis for more advanced permutation and probability problems involving multiple stages and restrictions.

A relatable example is selecting one Entrance gate at a stadium when only certain gates are open for visitors. The total possibilities depend entirely on how many gates are allowed for use.