h h h
play

H H H Resonance Draw the Lewis structure for nitromethane, CH 3 NO - PowerPoint PPT Presentation

Sep 30, 2023 •199 likes •337 views

Resonance Draw the Lewis structure of [CH 2 =CHCH 2 ] + H H H H H H . C C C C C C + + . + H C H H C H H C H H H H H H H H H H + + C C H C C H C C H H H H C C + C H H H Resonance Draw the Lewis

  1. Resonance Draw the Lewis structure of [CH 2 =CHCH 2 ] + H H H H H H . C C C C C C + + . + H C H H C H H C H H H H H H H H H H + + C C H C C H C C H H H H C C + C H H H

  2. Resonance Draw the Lewis structure for nitromethane, CH 3 NO 2 - . . .. . H . . H O . O . . C N C N + + H H .. . .. O O . . . H . . H -

  3. H1s 2 Osp 3 Csp H1s 2 Nsp .. .. H O + 2 Osp H1s C N H : O : H .. H1s .. H : O : + C N H 2 Osp . O . H .. 3 Csp H1s 2 Nsp 2 Osp H1s

  4. Common structural classes where resonance is observed Compounds with allylic lone pairs .. .. .. - : : O O .. -

  5. Common structural classes where resonance is observed Compounds with allylic positive charge + + +

  6. Common structural classes where resonance is observed Compounds with lone pairs next to positive charge .. . . + Br : Br .. .. +

  7. Nitromethane, CH 3 NO 2 , combines two structural classes where resonance is observed It is a compound with lone pairs next to positive charge and allylic lone pairs - . . .. . H . . H O . O . . C N C N + + H H .. . .. O O . . . H . . H -

  8. Common structural classes where resonance is observed Compounds with pi bonds between atoms of different electronegativities . .. .. - . O : : O +

  9. Common structural classes where resonance is observed Compounds with aromatic rings H H H H H H

  10. The concepts of resonance 1. Resonance is not something that is happening to a molecule. It is a way to describe the electronic distribution of a molecule. 2. Individual resonance isomers are imaginary, not real. a. They are representations of a hybrid structure b. The resonance hybrid is more stable than any individual resonance isomer contributing to it 3. Resonance isomers must be valid Lewis structures. 4. Resonance isomers differ only by the relative placement of their pi and nonbonding electrons in p orbitals. 5. Resonance isomers must have identical constitutions. Therefore, the hybridization states of the constituent atoms cannot change. 6. Resonance isomers must have the same number valence electrons and the same number of paired and unpaired electrons. 7. Different resonance isomers don’t have to be equivalent. Resonance isomers that describe the electronic configuration of a molecule most realistically have a. all octets full b. minimal formal charge c. minimal formal charge separation d. formal charge assignment according to relative electronegativities

  11. Heterocyclic aromatic compounds : pyridine H H H H H H H H H .- . X H N H H N H H N H .. .. + H H H N H H

  12. Consider resonance isomers of spinacine .. . . O H H .. N - : + O .. H . N . N . .

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Controllable Invariance through Adversarial Feature Learning Qizhe Xie, Zihang Dai, Yulun Du,

Controllable Invariance through Adversarial Feature Learning Qizhe Xie, Zihang Dai, Yulun Du,

Controllable Invariance through Adversarial Feature Learning Qizhe Xie, Zihang Dai, Yulun Du, Eduard Hovy, Graham Neubig Carnegie Mellon University Language Technologies Institute NIPS 2017 Outline Introduction Introduction Adversarial

308 views • 11 slides
AND USING C MODULES CSSE 120 Rose Hulman Institute of Technology Preamble: #define and typedef

AND USING C MODULES CSSE 120 Rose Hulman Institute of Technology Preamble: #define and typedef

STRUCTS, TYPEDEF, #DEFINE, AND USING C MODULES CSSE 120 Rose Hulman Institute of Technology Preamble: #define and typedef C allows us to define our own constants and type names to help make code more readable For more info, see Kochan,

584 views • 29 slides
Adversarial Training and Provable Defenses: Bridging the Gap S 0

Adversarial Training and Provable Defenses: Bridging the Gap S 0

Adversarial Training and Provable Defenses: Bridging the Gap S 0 1 1 = 1 2 3 Conv + ReLU Conv + ReLU Linear =

459 views • 17 slides
CS 225 Data Structures Au August 26 Cl Classes es and Ref efer eren ence ce Variables

CS 225 Data Structures Au August 26 Cl Classes es and Ref efer eren ence ce Variables

CS 225 Data Structures Au August 26 Cl Classes es and Ref efer eren ence ce Variables es G G Carl Evans St Stream Ru Rules TL;DR: Treat the stream like a classroom, don't say anything that would send you to the Dean of Students.

573 views • 22 slides
Logic as a Tool Chapter 2: Deductive Reasoning in Propositional Logic 2.2 Axiomatic systems for

Logic as a Tool Chapter 2: Deductive Reasoning in Propositional Logic 2.2 Axiomatic systems for

Logic as a Tool Chapter 2: Deductive Reasoning in Propositional Logic 2.2 Axiomatic systems for propositional logics Valentin Goranko Stockholm University October 2016 Goranko Hilbert-style axiomatic systems Based on axioms (or, axiom

115 views • 10 slides
MATH 12002 - CALCULUS I 2.1: Derivatives and Rates of Change Professor Donald L. White

MATH 12002 - CALCULUS I 2.1: Derivatives and Rates of Change Professor Donald L. White

MATH 12002 - CALCULUS I 2.1: Derivatives and Rates of Change Professor Donald L. White Department of Mathematical Sciences Kent State University D.L. White (Kent State University) 1 / 1 Introduction Our main goal in this section is to

157 views • 11 slides
63 negations Dave Ripley Universities of Connecticut and Melbourne Australasian Association for

63 negations Dave Ripley Universities of Connecticut and Melbourne Australasian Association for

1/ 52 63 negations Dave Ripley Universities of Connecticut and Melbourne Australasian Association for Logic 2013 davewripley@gmail.com 63 negations 2/ 52 1024 1024 to 100 100 to 63 63 davewripley@gmail.com 63 negations 1024 DLL, SM

737 views • 57 slides
Lecture 2: Image filtering PS1 due next Tuesday Updated office hours next week, due to

Lecture 2: Image filtering PS1 due next Tuesday Updated office hours next week, due to

Lecture 2: Image filtering PS1 due next Tuesday Updated office hours next week, due to holiday. New times will be on Piazza. Questions? Recall last week Extra edges Missing edges Input image Edges In this lecture What other

1.53k views • 74 slides
Price Discrimination & Screening Johan Stennek 1 Telia Summary Prata p

Price Discrimination & Screening Johan Stennek 1 Telia Summary Prata p

Price Discrimination & Screening Johan Stennek 1 Telia Summary Prata p Komple@ Monthly fee 50 700 Per 2-minute call 1.40 0 Features Telia offers menu of pricing plans Each plan has two parts : fixed fee +

792 views • 65 slides
2 3 5 6 7

2 3 5 6 7

2 3 5 6 7

417 views • 8 slides
Orthogonal Representations: from groups, through Hopf algebras, to tensor categories Susan

Orthogonal Representations: from groups, through Hopf algebras, to tensor categories Susan

Orthogonal Representations: from groups, through Hopf algebras, to tensor categories Susan Montgomery Woods Hole 2019 Let G be a finite group and V be a finite-dimensional irreducible representation of G over C . V is called orthogonal if it

497 views • 15 slides
Finite Difference Method Bernd Schr oder logo1 Bernd Schr oder Louisiana Tech University,

Finite Difference Method Bernd Schr oder logo1 Bernd Schr oder Louisiana Tech University,

Overview An Example Comparison to Actual Solution Conclusion Finite Difference Method Bernd Schr oder logo1 Bernd Schr oder Louisiana Tech University, College of Engineering and Science Finite Difference Method Overview An Example

1.34k views • 102 slides
Laplacian Pyramid-based Complex Neural Network Learning for Fast MR Imaging Haoyun Liang Paul C.

Laplacian Pyramid-based Complex Neural Network Learning for Fast MR Imaging Haoyun Liang Paul C.

Laplacian Pyramid-based Complex Neural Network Learning for Fast MR Imaging Haoyun Liang Paul C. Lauterbur Research Center for Biomedical Imaging, SIAT, CAS Accelerating MRI Fast Imaging Sequence Parallel Imaging Compressed Sensing Deep

836 views • 8 slides
Algorithmic Bias in Google Searches for Political Parties and Candidates Johannes Nakayama, Nils

Algorithmic Bias in Google Searches for Political Parties and Candidates Johannes Nakayama, Nils

Algorithmic Bias in Google Searches for Political Parties and Candidates Johannes Nakayama, Nils Plettenberg, Laura Burbach, Andr Calero Valdez Human-Computer Interaction Center, RWTH Aachen University The Datenspende BTW17 Dataset search

895 views • 30 slides
Quantum circuit optimisation, verification, and simulation with PyZX Aleks Kissinger

Quantum circuit optimisation, verification, and simulation with PyZX Aleks Kissinger

Quantum circuit optimisation, verification, and simulation with PyZX Aleks Kissinger aleks.kissinger@cs.ox.ac.uk John van de Wetering john@vdwetering.name Institute for Computing and Information Sciences Radboud University Nijmegen February

858 views • 34 slides
Lecture 5.5: p -groups Matthew Macauley Department of Mathematical Sciences Clemson University

Lecture 5.5: p -groups Matthew Macauley Department of Mathematical Sciences Clemson University

Lecture 5.5: p -groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 5.5: p -groups Math 4120, Modern Algebra 1 / 7

118 views • 7 slides
f Slides 3.3 Normal subgroups is the set of elements that normalize He wording we say Ngat E Ng H

f Slides 3.3 Normal subgroups is the set of elements that normalize He wording we say Ngat E Ng H

Sec 3.6 Normalizers and another application of corsets not normal in G Idea If H L G but H G measure how far It is from being normal we want to H OG iff Recall the Def V xH Hx X E G how far It is from being normal One way to measure X E G e

511 views • 3 slides
Classical (co)homology theory Let X be a topological space. Can define abelian groups H ( X

Classical (co)homology theory Let X be a topological space. Can define abelian groups H ( X

Classical (co)homology theory Let X be a topological space. Can define abelian groups H ( X ; Z ) and H ( X ; Z ) given by very cute construction of the so-called chains and co-chains. Very useful invariants. Grothendieck taught us

548 views • 9 slides
h -polynomials of triangulations of flow polytopes Karola M esz aros (Cornell University) h

h -polynomials of triangulations of flow polytopes Karola M esz aros (Cornell University) h

h -polynomials of triangulations of flow polytopes Karola M esz aros (Cornell University) h -polynomials of triangulations of flow polytopes (and of reduction trees) Karola M esz aros (Cornell University) Plan Background on flow

965 views • 92 slides
Derivatives of Trigonometric Functions Let f ( x ) = sin x . From the definition of a derivative, f

Derivatives of Trigonometric Functions Let f ( x ) = sin x . From the definition of a derivative, f

Derivatives of Trigonometric Functions Let f ( x ) = sin x . From the definition of a derivative, f ( x + h ) f ( x ) f ( x ) = lim h 0 = h sin( x + h ) sin x lim h 0 . h Conveniently, we have a trigonometric identity that

63 views • 3 slides
Math 211 Math 211 Lecture #12 Eulers Method September 24, 2001 2 Numerical Methods

Math 211 Math 211 Lecture #12 Eulers Method September 24, 2001 2 Numerical Methods

1 Math 211 Math 211 Lecture #12 Eulers Method September 24, 2001 2 Numerical Methods Numerical Methods A numerical solution is not a solution. It is a discrete approximation to a solution. We make an error on purpose to

379 views • 18 slides
Cumulative Sum and Moving Average Charts Introduction The Shewhart charts support actions that

Cumulative Sum and Moving Average Charts Introduction The Shewhart charts support actions that

ST 435/535 Statistical Methods for Quality and Productivity Improvement / Statistical Process Control Cumulative Sum and Moving Average Charts Introduction The Shewhart charts support actions that are based on the last sample observation:

408 views • 11 slides
MA/CSSE 473 Summer 2010 Additional comments on 200910 PowerPoint slides Day 2 Slide 2 Some

MA/CSSE 473 Summer 2010 Additional comments on 200910 PowerPoint slides Day 2 Slide 2 Some

MA/CSSE 473 Summer 2010 Additional comments on 200910 PowerPoint slides Day 2 Slide 2 Some parts of the definition of "Algorithm": Sequence of instructions For solving a problem Unambiguous (including order) Can depend on input

533 views • 4 slides
Adapted Bases and Fast Transforms Michael Orrison Harvey Mudd College Joint Work with Michael

Adapted Bases and Fast Transforms Michael Orrison Harvey Mudd College Joint Work with Michael

Adapted Bases and Fast Transforms Michael Orrison Harvey Mudd College Joint Work with Michael Hansen and Masanori Koyama Functions Let X = { x 1 , . . . , x n } be a finite set, and let C X be the complex vector space of complex-valued functions

326 views • 30 slides

More recommend