Skip to content

Add combinatorics bundle to Quant counting-probability - #22

Draft
DMDaudio wants to merge 1 commit into
mainfrom
claude/nice-feynman-1kf4n1
Draft

Add combinatorics bundle to Quant counting-probability#22
DMDaudio wants to merge 1 commit into
mainfrom
claude/nice-feynman-1kf4n1

Conversation

@DMDaudio

Copy link
Copy Markdown
Owner

What does this PR add or change?

Adds first-time coverage of the empty quant / counting-probability / combinatorics subtopic:

  • 1 lessonquant-counting-probability-combinatorics: fundamental counting principle, permutations vs. combinations, the block method for adjacency restrictions, and complementary counting for "at least one."
  • 6 original questions (00170022), easy → hard:
    • 0017 (easy) — fundamental counting principle (sandwich choices)
    • 0018 (easy) — basic permutation (arrange 5 distinct books)
    • 0019 (medium) — single-group combination (committee of 3 from 8)
    • 0020 (medium) — two-group committee (exactly 2 men + 2 women)
    • 0021 (hard) — arrangement with an adjacency restriction (block method)
    • 0022 (hard) — "at least one" via the complement

Every question has a worked explanation, two hints, and distractors keyed to specific common errors (add-vs-multiply, permutation-vs-combination, forgetting a block's internal order, reporting the complement, and the classic "at least one" over-count). Rebuilt docs/data/content.json via node scripts/build.mjs0 warnings.

Type of change

  • New question(s)
  • New lesson(s)
  • Fix to existing content (answer / explanation / tag)
  • Tooling / docs / schema

Author checklist

  • This is my own original work — not copied or paraphrased from any real GMAT question or prep material.
  • Front-matter follows CONTENT_SCHEMA.md (id matches the filename; topic/subtopic exist in curriculum.md).
  • I solved every question myself and confirmed exactly one answer choice is correct.
  • Each explanation would help someone who got the question wrong, and names the trap where relevant.
  • status is in-review. I did not set my own content to verified.

For reviewers

  • I solved the question(s) without reading the keyed answer first and got the same answer.
  • Exactly one choice is correct; distractors are plausible.
  • Explanation and tags (section / topic / difficulty) are accurate.
  • If approving: bumped status to verified and added my handle to reviewers.

Generated by Claude Code

Adds coverage for the previously empty quant/counting-probability/
combinatorics subtopic:

- 1 lesson: fundamental counting principle, permutations vs.
  combinations, block method, complementary counting.
- 6 original questions (0017-0022), easy -> hard: fundamental counting,
  basic permutation, single-group combination, two-group committee,
  adjacency restriction (block method), and "at least one" via the
  complement.

Each question has a worked explanation, two hints, and distractors keyed
to specific common errors (add-vs-multiply, permutation-vs-combination,
forgetting the block's internal order, reporting the complement, and the
classic "at least one" over-count). All solved and verified to have
exactly one correct choice. Rebuilt docs/data/content.json (0 warnings).

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01V2biPGGKJckZFsXJVsfHWa
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants