In geometry, the small ditrigonal dodecicosidodecahedron (or small dodekified icosidodecahedron) is a nonconvex uniform polyhedron, indexed as U43. It has 44 faces (20 triangles, 12 pentagrams and 12 decagons), 120 edges, and 60 vertices. Its vertex figure is a crossed quadrilateral. (Wikipedia).
How to Construct a Dodecahedron
How the greeks constructed the Dodecahedron. Euclids Elements Book 13, Proposition 17. In geometry, a dodecahedron is any polyhedron with twelve flat faces. The most familiar dodecahedron is the regular dodecahedron with regular pentagons as faces, which is a Platonic solid. A regular dode
From playlist Platonic Solids
Canonical structures inside the Platonic solids III | Universal Hyperbolic Geometry 51
The dodecahedron is surely one of the truly great mathematical objects---revered by the ancient Greeks, Kepler, and many mathematicians since. Its symmetries are particularly rich, and in this video we look at how to see the five-fold and six-fold symmetries of this object via internal str
From playlist Universal Hyperbolic Geometry
This shows a 3d print of a mathematical sculpture I produced using shapeways.com. This model is available at http://shpws.me/q0PF.
From playlist 3D printing
In this veideo we continue our look in to the dihedral groups, specifically, the dihedral group with six elements. We note that two of the permutation in the group are special in that they commute with all the other elements in the group. In the next video I'll show you that these two el
From playlist Abstract algebra
What is the difference between convex and concave polygons
👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1
From playlist Classify Polygons
What is the difference between convex and concave
👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1
From playlist Classify Polygons
What is the difference between concave and convex polygons
👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1
From playlist Classify Polygons
What are the names of different types of polygons based on the number of sides
👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1
From playlist Classify Polygons
What are four types of polygons
👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1
From playlist Classify Polygons
Scotland Ruby 2011 - What Ruby Can Learn From Smalltalk
by: Steven Baker Smalltalk is one of the forefathers of Object Oriented programming, and has a long history of being used in the field. One of the quiet players, many have heard of Smalltalk without having worked with it, but Smalltalk is indispensable in many industries including insuran
From playlist Scotland Ruby 2011
MountainWest RubyConf 2014 - But Really, You Should Learn Smalltalk
By Noel Rappin Smalltalk has mystique. We talk about it more than we use it. It seems like it should be so similar to Ruby. It has similar Object-Oriented structures, it even has blocks. But everything is so slightly different, from the programming environment, to the 1-based arrays, to t
From playlist MWRC 2014
Lec 11 | MIT 6.002 Circuits and Electronics, Spring 2007
Small signal circuits View the complete course: http://ocw.mit.edu/6-002S07 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT 6.002 Circuits and Electronics, Spring 2007
PrepTest 5 Game 2: A Grouping Game with No Groups // Logic Games [#18] [LSAT Analytical Reasoning]
We've seen a grouping game with no elements before (https://youtu.be/5U0mlFdeZ6c), so how about a grouping game with no groups. This is the second game of the June 1992 LSAT games section. I suppose it's not quite right to say it has no groups. The way I diagram it is as if there are three
From playlist LSAT Games
Lec 7 | MIT 6.002 Circuits and Electronics, Spring 2007
Incremental analysis View the complete course: http://ocw.mit.edu/6-002S07 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT 6.002 Circuits and Electronics, Spring 2007
A tale of two dynamos: turbulent large-scale and small-scale dynamos by Pallavi Bhat
Abstract: Coherent magnetic fields are ubiquitous in the universe as in the Sun, stars, galaxies and galaxy clusters. The theory of turbulent dynamos is the leading paradigm to understand the origin of these magnetic fields. A particularly generic process in turbulent astrophysical system
From playlist ICTS Colloquia
Grigorios Paouris: Non-Asymptotic results for singular values of Gaussian matrix products
I will discuss non-asymptotic results for the singular values of products of Gaussian matrices. In particular, I will discuss the rate of convergence of the empirical measure to the triangular law and discuss quantitive results on asymptotic normality of Lyapunov exponents. The talk is bas
From playlist Workshop: High dimensional measures: geometric and probabilistic aspects
HYBRID EVENT Recorded during the meeting "Logic and Interactions" the February 22, 2022 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual M
From playlist Topology
A fold-up, slice-and-dice dodecahedron and its complement. With a 3D printer, you can make your own using the files here: http://georgehart.com/rp/T-O-M/t-o-m.html
From playlist Odds and Ends
Ruby Conference 2008 - Ruby Persistence in MagLev
By: Bob Walker, Allan Ottis Help us caption & translate this video! http://amara.org/v/GH3J/
From playlist Ruby Conference 2008
