Chem 107: Inorganic Chemistry (40720)

Similar documents
Polygons POLYGONS.

1 Introduction to Modulo 7 Arithmetic

0.1. Exercise 1: the distances between four points in a graph

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

Chem 104A, Fall 2016, Midterm 1 Key

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

Planar Upward Drawings

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

QUESTIONS BEGIN HERE!

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Present state Next state Q + M N

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Module 2 Motion Instructions

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

COMP108 Algorithmic Foundations

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

OpenMx Matrices and Operators

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

Construction 11: Book I, Proposition 42

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

QUESTIONS BEGIN HERE!

Designing A Concrete Arch Bridge

Garnir Polynomial and their Properties

Decimals DECIMALS.

TOPIC 5: INTEGRATION

Section 3: Antiderivatives of Formulas

Constructive Geometric Constraint Solving

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

CS September 2018

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

What do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

Instructions for Section 1

Tangram Fractions Overview: Students will analyze standard and nonstandard

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Aquauno Video 6 Plus Page 1

UNCORRECTED SAMPLE PAGES. Length, area, surface 5area and volume. Online resources. What you will learn

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Physics 222 Midterm, Form: A

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

C-201 Sheet Bar Measures 1 inch

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Last time: introduced our first computational model the DFA.

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

Binomials and Pascal s Triangle

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

Trees as operads. Lecture A formalism of trees

Walk Like a Mathematician Learning Task:

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

EE1000 Project 4 Digital Volt Meter

Formal Concept Analysis

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

Numbering Boundary Nodes

CS 241 Analysis of Algorithms

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Seven-Segment Display Driver

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

Fractions. Mathletics Instant Workbooks. Simplify. Copyright

On each of them are the numbers +6, 5, +4, 3, +2, 1. The two dice are rolled. The score is obtained by adding the numbers on the upper faces.

UNCORRECTED PAGE PROOFS

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

EEO 401 Digital Signal Processing Prof. Mark Fowler

Linear Algebra Existence of the determinant. Expansion according to a row.

Problem solving by search

Section 10.4 Connectivity (up to paths and isomorphism, not including)

Elliptical motion, gravity, etc

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Multi-Section Coupled Line Couplers

WORKSHOP 6 BRIDGE TRUSS

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.

Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM

Transcription:

Chm 107: Inorgni Chmistry (40720) Prossor Mtt Lw -mil: lwm@ui.u Oi Hours: W 3:00-4:00p n Thurs 11-noon in NS2 2127 TAs Julit Khosrowi -mil: jkhosrow@ui.u Oi Hours: Tus 2:00-3:00p, 3 r loor tls, Rins Hll Kyl Rosnkottr -mil: krosnko@ui.u Oi Hours: Mony 4:00-5:00p, NS1 3213 Clss wsit: http://www.hm.ui.u/~lwm/107.html

Txtook Syllus Misslr, G. L.; Fishr, P. J, Trr, D. A. Inorgni Chmistry. 5th Eition; ISBN 0-321-81105-4. Ltur Slis Ltur slis r post to th ours wsit s PDF ils or or just tr h ltur. Homwork Spling Lrning onlin homwork (gr), plus suggst prolms rom txtook (ungr) Disussion Stions Will gin mting nxt wk (9/28/15). Disussion sssions r optionl, ut will giv you vlul intrtiv prti with th ours mtril.

Syllus Vio Lturs Vios rom lst yr s lturs r vill on lss wsit, ourtsy o UCI Opn Chmistry Inititiv Son hl o th vios tur Pro. Hyuk, so will irnt this yr Bst us s stuy i, not rgulr sustitut or ttning liv lturs

Onlin Homwork Syllus Gr onlin homwork ssignmnts or h hptr vi Spling Lrning. Sign up hr: http://it.ly/splinginstrutions $30 or th qurtr 10% o ours gr Thnology TA: Dr. Kthrin Kon, support@splinglrning.om First ssignmnt vill nxt wk

Ltur Shul W will ovr Chptrs 4-11 Mitrm I (Ch. 4,5,7) Mitrm II (Ch. 6,7,8,9) Finl (Ch. 4-11) Syllus You r rsponsil or th kgroun mtril in Chptrs 1-3!

Exms Two mitrms n on inl. Exms r umultiv. Syllus Thr r no mk-up xms. I you miss mitrm or n pprov rson, th vlu o th inl will just oringly. S ours syllus or tils. Dt Assignmnt Prntg Friy, Ot 23 r Mitrm Exm I 20 Ws, Nov 18 th Mitrm Exm II 30 W, D 9 th, 8:00 Finl Exm 40 Onlin Homwork 10 Totl 100

Chm 107 on th W Th Chm 107 wsit is your sour or up-to-t inormtion rgring this lss. http://www.hm.ui.u/~lwm/107.html Th lss wsit is ssil through EEE, th UCI Chmistry Dprtmnt wsit, googl, t. Dtil syllus, ltur shul, suggst txtook homwork prolms n nswr kys, ltur slis, links to vio lturs, rings, n nnounmnts r vill hr.

Emil Contt E-mils will only pt n nswr or UCI mil rsss Pls ourtous n rsptul whn ontting m or th TAs. Just lik you, w r vry usy n w hv mny ommitmnts outsi o this lss. To mil us pls us th ormt low n w will gt k to you ASAP. Sujt: Chm 107 Dr Prossor Lw, I h qustion rgring somthing in ltur/th txt/on th xm/t. Pls inlu s muh inormtion s possil so tht w n gt n nswr to you ASAP. Thnks or your tim, Ptr/Ptr Anttr UCI ID #

Symmtry in Ntur

Symmtry rom othr plnts

Symmtry Elmnts Symmtry Elmnts n Oprtions An lmnt is gomtri ojt ( pln, lin (xis), or point). Symmtry Oprtions An oprtion is movmnt (rltion, rottion, invrsion) rri out with rspt to symmtry lmnt To possss symmtry oprtion, n ojt must ppr inistinguishl or/tr prorming th symmtry oprtion Elmnt mirror pln propr xis impropr xis Oprtion rltion in th pln rottion out th xis rottion, ollow y rltion in in pln to th xis ntr o invrsion invrsion o ll toms thru ntr Thr r iv oprtions: rltion (σ), propr rottion (C n ), impropr rottion (S n ), invrsion (i), n intity (E)

Th Intity Intity Oprtion (E) th o nothing oprtion (th simplst oprtion) mthmtilly quivlnt to multiplying y 1 ll ojts hv E E

Propr Rottions Rottion Oprtion (Cn) ountr-lokwis rottion o 2π/n (360 /n) out n xis = 2 = C3

Propr Rottions Rottion Oprtion (Cn) ountr-lokwis rottion o 2π/n (360 /n) out n xis = 3 = C2

Propr Rottions Rottion Oprtion (Cn) ountr-lokwis rottion o 2π/n (360 /n) out n xis = 4 = C3 2

Rottion Oprtion (Cn) Propr Rottions ountr-lokwis rottion o 2π/n (360 /n) out n xis C3 2 = C3 1 C3 1 (invrs C3) is rottion kwrs (lokwis)

Propr Rottions Rottion Oprtion (Cn) ountr-lokwis rottion o 2π/n (360 /n) out n xis 1 = 5

Propr Rottions Rottion Oprtion (Cn) ountr-lokwis rottion o 2π/n (360 /n) out n xis Now w n lso sy 6 = C1 = E

Rottion Oprtion (Cn) Propr Rottions ountr-lokwis rottion o 2π/n (360 /n) out n xis th rottion xis with th lrgst n is ll th highst orr or prinipl xis (th C 6 xis in th s o our snowlk) som ojts hv rottions tht r prpniulr to th prinipl xis 180 C2 ()

Rottion Oprtion (Cn) Propr Rottions ountr-lokwis rottion o 2π/n (360 /n) out n xis th rottion xis with th lrgst n is ll th highst orr or prinipl xis (th C 6 xis in th s o our snowlk) som ojts hv rottions tht r prpniulr to th prinipl xis n ojt with Cn xis must hv zro or n prpniulr C2 xs th snowlk hs oinint C 6, C 3, n C 2 xs plus six C 2 xs 180 C2 ( )

Rltions Rltion Oprtion (σ) n intrnl rltion thru pln o symmtry within n ojt horizontl mirror pln (σh) is prpniulr to th prinipl xis σ n = E whn n is vn σ n = σ whn n is o

Rltion Oprtion (σ) Rltions n intrnl rltion thru pln o symmtry within n ojt horizontl mirror pln (σh) is prpniulr to th prinipl xis vrtil (σv) n ihrl (σ) mirror plns r prlll to th prinipl xis #σv + #σ = 0 or n our snowlk hs on σh, thr σv n thr σ mirror plns σv σ

Invrsion Oprtion (i) Invrsion h point is mov long stright lin through th ntr o th ojt (th invrsion ntr) to point n qul istn rom th ntr in othr wors: (x,y,z) (-x,-y,-z) or ll points n ojt n hv zro or on invrsion ntr th snowlk hs n invrsion ntr i i n = E whn n is vn, i n = i whn n is o

Invrsion Oprtion (i) Invrsion othr, oxs, squrs, rtngls, n prlllogrms hv invrsion ntrs, ut ttrhr, tringls, n pntgons o not ys invrsion ntrs no invrsion ntrs

Impropr Rottions Impropr Rottion Oprtion (Sn) rottion ollow y prpniulr rltion ( roto-rltion) S 4 oprtion in mthn Also: S 2 = i, S 1 = σ Thr r S 3 n S 6 oprtions in th snowlk, ut w ll illustrt th S n oprtion with n tul molul in minut.