MIT 3.091: Introduction to Solid-State Chemistry
3.091 is one of MIT's chemistry GIR options: atomic structure, bonding, and thermodynamics taught through solids and real materials (crystals, semiconductors, glasses, and polymers). Made famous by Donald Sadoway's lectures, it's the GIR with a devoted following well beyond MIT.
Fennie is independent and not affiliated with MIT. This is an unofficial study guide.
What makes it hard
The breadth is the trap: electronic structure, crystallography, defects, diffusion, and biochemistry units pass quickly, each with its own vocabulary and calculation styles. Exams demand quick, accurate setups across all of them, and the crystallography unit (Miller indices, packing geometry) is the classic stumble for students who skimped on spatial practice.
What you'll cover
- • Atomic and electronic structure
- • Chemical bonding in solids
- • Crystallography and Miller indices
- • Defects and diffusion
- • Band theory and semiconductors
- • Glasses and polymers
The 3.091 study guide
How to study for MIT 3.091, step by step.
- 1
Anchor every unit to a real material
Silicon for band theory, steel for defects, glass for amorphous structure: 3.091 teaches chemistry through materials, and remembering the anchor material brings the concepts back with it.
- 2
Practice crystallography by drawing, not staring
Miller indices, unit cells, and packing fractions are spatial skills. Sketch the planes and count the atoms by hand for every practice problem; the visual fluency is exactly what exams time you on.
- 3
Keep a calculation-type inventory
Each unit has signature computations: d-spacings, diffusion profiles, carrier concentrations. List them as you go and rehearse the setups; exam speed comes from recognizing the type instantly.
- 4
Rotate old units weekly
The breadth means week-three material can be six exams old by the final. A short weekly pass through earlier units keeps the whole inventory live at a fraction of relearning cost.
Today
Today's 3.091 plan
What a Fennie Daily Plan looks like for 3.091. Yours is built from your own syllabus and adapts every day to your deadlines and progress.
First plan free, no card required. Fennie is independent and unaffiliated with your school.
FAQ
Is 3.091 easier than 5.111?
Both satisfy the chemistry GIR; 3.091 trades quantum-first abstraction for materials applications and breadth. Students who like tangible examples often prefer it; the workload is comparable.
Is 3.091 available on OCW?
Yes, including versions with the Sadoway lectures that made the course famous, plus notes and exams. It doubles as a strong materials-science introduction for self-learners.
What's the hardest part of 3.091?
Crystallography, by reputation. Miller indices and packing geometry punish weak spatial practice. The cure is drawing the structures by hand until the visualization is routine.
More MIT courses
6.100A: Introduction to Computer Science Programming in Python
6.100A, formerly 6.0001 (the number most search results still use), is MIT's half-semester introduction to programming in Python for students with little or no experience. The 6.0001 lectures on OpenCourseWare are among the most popular free programming courses anywhere.
6.006: Introduction to Algorithms
6.006 is MIT's core algorithms class, covering sorting, hashing, trees, graph algorithms, shortest paths, and dynamic programming, with emphasis on both rigorous analysis and Python implementation. Its OpenCourseWare lectures are a global standard for learning algorithms and prepping technical interviews.
6.046J: Design and Analysis of Algorithms
6.046J, renumbered 6.1220 in MIT's current catalog but still searched overwhelmingly by its old number, is the advanced algorithms course following 6.006: divide and conquer, randomized algorithms, amortization, network flow, approximation, and complexity. The OCW lectures are a staple for advanced self-study.
6.042J: Mathematics for Computer Science
6.042J, now numbered 6.1200J, is MIT's discrete math course for CS: proofs, induction, number theory, graph theory, counting, and discrete probability. Its OCW versions, with full lecture videos and the famous free textbook, make it one of the most-used discrete math resources in the world.