---
title: "Selection Without Replacement | Intro to Probability"
description: "Selection without replacement is drawing items without putting them back, so probabilities change each draw in Intro to Probability problems and count methods."
canonical: "https://fiveable.me/introduction-probability/key-terms/selection-without-replacement"
type: "key-term"
subject: "Intro to Probability"
unit: "Unit 3"
---

# Selection Without Replacement | Intro to Probability

## Definition

Selection without replacement means you choose items from a set and do not put them back, so the pool gets smaller after each draw. In Intro to Probability, that changes the sample space and the probabilities for later draws.

## What It Is

Selection without replacement is the setup where each item you draw is removed from the group before the next draw happens. In Intro to Probability, that means the sample space changes from one step to the next, because the remaining options are no longer the same as they were at the start.

That changing pool is the whole point. If you draw a card from a deck and keep it out, the next draw is based on 51 cards instead of 52. If you choose a student for a committee and do not allow repeats, the second choice comes from fewer people. The probabilities are no longer constant across draws, so you cannot treat the process like each trial is identical.

A lot of confusion comes from mixing this up with replacement. With replacement, the item goes back into the set, so the size of the pool stays the same and the probabilities can stay the same from draw to draw. Without replacement, every successful draw changes what is left, which is why order can matter in the actual process even when the final set of chosen items is what you care about.

For counting, this idea shows up in combinations and binomial coefficients. When order does not matter, you count how many groups of size k can be chosen from n items using n choose k. But when you are calculating a probability of multiple draws without replacement, you often work step by step with conditional probability, multiplying probabilities that change after each draw.

A quick example makes the pattern obvious. Suppose a bag has 3 red marbles and 2 blue marbles, and you draw 2 marbles without replacement. The chance of red then blue is 3/5 times 2/4, because after taking a red marble out, there are only 4 marbles left and 2 of them are blue. If you wanted blue then red, you would use 2/5 times 3/4 instead. The order of the draws affects the calculation, even though the final pair is one red and one blue either way.

## Why It Matters

Selection without replacement shows up every time Intro to Probability moves from one-shot events to multi-step draws. It is the reason card problems, marble problems, sampling problems, and many counting questions behave differently from a simple repeated-trial model.

This term also connects probability to counting. If you are finding how many hands, committees, or samples are possible, you need to know whether items can repeat. Without replacement, the same object cannot appear twice, so combinations and binomial coefficients become the right counting tool for unordered selections.

It also changes how you read probability language. A phrase like "two draws from a deck" does not automatically mean the draws are independent. If the first card is not returned, the second probability depends on what happened first. That is a big step in the course, because independence is one of the main ideas you keep checking for when building a probability model.

In practice, this term is what tells you whether to use a fixed-probability model or a changing-probability model. That choice affects every later step, from writing the sample space to calculating the final probability.

## Connections

### Combinations

Combinations count selections where order does not matter, which is exactly the kind of counting that often comes up when you pick items without replacement. If you are choosing a group, team, or hand and only care about which items are included, combinations give the number of possible groups. The without-replacement part keeps items from repeating in the same selection.

### Permutations

Permutations count arrangements where order does matter, so they are useful when the sequence of draws or assignments changes the outcome. Without replacement, permutation-style reasoning can show how many ordered outcomes are possible when you cannot reuse an item. This is the counting version of the same no-repeat idea.

### Binomial Coefficients

Binomial coefficients, written as n choose k, are the numbers that count how many ways you can choose k items from n without replacement. They show up in probability when you need to count unordered samples or build probability formulas for selecting groups. In this course, they are the bridge between counting and probability.

## On the AP Exam

A quiz or problem set will usually ask you to decide whether a situation is with or without replacement before you calculate anything. If the items are not put back, you update the denominator after each draw and often multiply conditional probabilities step by step. For a counting question, you may need to use combinations instead of treating the draws like repeated independent picks. The main move is to watch how the sample space shrinks, then choose the right counting or probability method based on that change. If the question asks for an ordered result, keep track of the sequence. If it asks for an unordered group, focus on the final selection and not the order you picked the items in.

## Selection without replacement vs Selection with replacement

With replacement means you put the item back before the next draw, so the pool stays the same and the probabilities can stay constant. Without replacement means the pool shrinks after each draw, so later probabilities change. That difference affects both probability calculations and whether a process can be treated like independent trials.

## Key Takeaways

- Selection without replacement means an item cannot be chosen again after it has been drawn.
- Each draw changes the sample space, so later probabilities are based on what is left.
- This setup is common in card problems, marble problems, samples, and committee selection.
- Without replacement usually means you need conditional probability or a counting method that matches the shrinking pool.
- If order does not matter, combinations and binomial coefficients are often the right tools.

## FAQs

### What is selection without replacement in Intro to Probability?

It is a drawing process where you do not put an item back after selecting it. That means the number of available outcomes gets smaller after each draw, so the probability for the next draw can change. This is the standard setup for many card, sample, and group-selection problems.

### How is selection without replacement different from with replacement?

With replacement, the item goes back into the set, so the pool stays the same and the draw probabilities can stay the same. Without replacement, the item is removed, so the pool shrinks and the later probabilities change. That is why the two setups use different formulas and different reasoning.

### Do you use combinations for selection without replacement?

Often, yes, when order does not matter. Combinations count how many groups of items you can choose without repeating anything, which fits many without-replacement situations. If the problem cares about the order of the draws, you may need step-by-step probability or permutations instead.

### How do you calculate probability without replacement?

You usually multiply probabilities for each draw, updating the denominator after each selection. For example, if you draw two items from a set and do not replace the first one, the second probability is based on the smaller remaining set. This is a common place to use conditional probability.

## Related Study Guides

- [3.3 Combinations and binomial coefficients](/introduction-probability/unit-3/combinations-binomial-coefficients/study-guide/NLd3apchq1uWxLNi)

## About This Document

Canonical Fiveable pages are available as Markdown at the same path plus `.md`.

- [llms.txt](https://fiveable.me/llms.txt): index of Fiveable's sections and URL patterns
- [llms-full.txt](https://fiveable.me/llms-full.txt): complete subject and unit listing
- [MCP server](https://fiveable.me/mcp): call Fiveable as tools instead of fetching pages (`https://fiveable.me/api/mcp`)
- [MCP server for AP teachers](https://fiveable.me/mcp/teachers): a teacher's classes, assignments and AP-rubric grading (`https://fiveable.me/api/mcp/teacher`)

## Structured Data

```json
{"@context":"https://schema.org","@graph":[{"@type":"LearningResource","@id":"https://fiveable.me/introduction-probability/key-terms/selection-without-replacement#resource","name":"Selection Without Replacement | Intro to Probability","url":"https://fiveable.me/introduction-probability/key-terms/selection-without-replacement","learningResourceType":"Concept explainer","educationalLevel":"AP® / High School","about":{"@id":"https://fiveable.me/introduction-probability/key-terms/selection-without-replacement#term"},"audience":{"@type":"EducationalAudience","educationalRole":"student"},"dateModified":"2026-07-03T02:23:02.089Z","isPartOf":{"@type":"Collection","name":"Intro to Probability Key Terms","url":"https://fiveable.me/introduction-probability/key-terms"},"author":{"@type":"Organization","@id":"https://fiveable.me/editorial#content-team","name":"Fiveable Content Team","url":"https://fiveable.me/editorial","parentOrganization":{"@id":"https://fiveable.me/#organization"},"member":[{"@type":"Person","name":"Amanda DoAmaral","sameAs":["https://www.linkedin.com/in/adoamaral"]},{"@type":"Person","name":"Becky Bahr","sameAs":["https://www.linkedin.com/in/becky-bahr-b52743132"]}]},"publisher":{"@type":"Organization","name":"Fiveable","url":"https://fiveable.me"}},{"@type":"DefinedTerm","@id":"https://fiveable.me/introduction-probability/key-terms/selection-without-replacement#term","name":"Selection without replacement","description":"Selection without replacement means you choose items from a set and do not put them back, so the pool gets smaller after each draw. In Intro to Probability, that changes the sample space and the probabilities for later draws.","url":"https://fiveable.me/introduction-probability/key-terms/selection-without-replacement","inDefinedTermSet":{"@type":"DefinedTermSet","name":"Intro to Probability Key Terms","url":"https://fiveable.me/introduction-probability/key-terms"}},{"@type":"FAQPage","mainEntity":[{"@type":"Question","name":"What is selection without replacement in Intro to Probability?","acceptedAnswer":{"@type":"Answer","text":"It is a drawing process where you do not put an item back after selecting it. That means the number of available outcomes gets smaller after each draw, so the probability for the next draw can change. This is the standard setup for many card, sample, and group-selection problems."}},{"@type":"Question","name":"How is selection without replacement different from with replacement?","acceptedAnswer":{"@type":"Answer","text":"With replacement, the item goes back into the set, so the pool stays the same and the draw probabilities can stay the same. Without replacement, the item is removed, so the pool shrinks and the later probabilities change. That is why the two setups use different formulas and different reasoning."}},{"@type":"Question","name":"Do you use combinations for selection without replacement?","acceptedAnswer":{"@type":"Answer","text":"Often, yes, when order does not matter. Combinations count how many groups of items you can choose without repeating anything, which fits many without-replacement situations. If the problem cares about the order of the draws, you may need step-by-step probability or permutations instead."}},{"@type":"Question","name":"How do you calculate probability without replacement?","acceptedAnswer":{"@type":"Answer","text":"You usually multiply probabilities for each draw, updating the denominator after each selection. For example, if you draw two items from a set and do not replace the first one, the second probability is based on the smaller remaining set. This is a common place to use conditional probability."}}]},{"@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Intro to Probability","item":"https://fiveable.me/introduction-probability"},{"@type":"ListItem","position":2,"name":"Key Terms","item":"https://fiveable.me/introduction-probability/key-terms"},{"@type":"ListItem","position":3,"name":"Unit 3","item":"https://fiveable.me/introduction-probability/unit-3"},{"@type":"ListItem","position":4,"name":"Selection without replacement"}]}]}
```