Free ebook http://tinyurl.com/EngMathYT How to integrate over 2 curves. This example discusses the additivity property of line integrals (sometimes called path integrals).
From playlist Engineering Mathematics
Octagonal Faced Protective Cover in GeoGebra 3D Calculator
It’s not an every-day occurrence to find 3 1/4-regular-octagons w/same center & where each is orthogonal to other 2 (packing material 🙂). Given (0,0,0) = center & side = 6.4, what are possible coordinate setups for other vertices? 🤔 #GeoGebra #3d #MTBoS #ITeachMath #math #maths
From playlist GeoGebra 3D with AR (iOS): Explorations, Demos, and Lesson Ideas
From playlist Drawing a sphere
Geogebra - Restricting a Slider
In this video we restrict aspects of the GeoGebra applet to help students discover an answer on their own
From playlist Geogebra
Here we show a quick way to set up a face in desmos using domain and range restrictions along with sliders. @shaunteaches
From playlist desmos
Using the SLIDER & CIRCLE WITH CENTER AND RADIUS Tools: GeoGebra Beginner Exercise 13
Screencast demonstrates how to use GeoGebra's SLIDER & CIRCLE WITH CENTER AND RADIUS tools. Here, we build a triangle with 3 side lengths where each side is controlled by a slider. This helps students easily discover the Triangle Inequality Theorem. Engage here: https://www.geogebra.org
From playlist GeoGebra Geometry & Graphing Calculator: BEGINNER Tutorial Series
How to use the Angle Bisector Tool
From playlist GeoGebra Geometry
Sweeping under area of a curve
From playlist 2d graphs
Flow through a single piece of area
From playlist Surface integrals
Vertex Covers and Vertex Covering Numbers | Graph Theory
We introduce vertex covers, minimum vertex covers, and vertex covering numbers! We'll see some examples and non-examples of vertex covers, as well as minimum vertex covers and some that aren't minimum. The number of vertices in a minimum vertex cover is called the vertex covering number of
From playlist Graph Theory
Jeff Erickson - Lecture 4 - Two-dimensional computational topology - 21/06/18
School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects (http://geomschool2018.univ-mlv.fr/) Jeff Erickson (University of Illinois at Urbana-Champaign, USA) Two-dimensional computational topology - Lecture 4 Abstract: This series of lectures will describe recent
From playlist Jeff Erickson - School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects
Dimers and Integrability - Richard Kenyon
Richard Kenyon Brown University March 29, 2013 This is joint work with A. B. Goncharov. To any convex integer polygon we associate a Poisson variety, which is essentially the moduli space of connections on line bundles on (certain) bipartite graphs on a torus. There is an underlying integr
From playlist Mathematics
X-Ramanujan graphs: ex uno plures - Ryan O'Donnell
Computer Science/Discrete Mathematics Seminar Topic: X-Ramanujan graphs: ex uno plures Speaker: Ryan O'Donnell Affiliation: Carnegie Mellon University Time/Room: 3:30pm - 4:30pm/Simonyi Hall 101 Date: October 29, 2018 For more video please visit http://video.ias.edu
From playlist Mathematics
Idealness of k-wise intersecting families, by Tony Huynh
CMSA Combinatorics Seminar, 6 October 2020
From playlist CMSA Combinatorics Seminar
Daniela Egas Santander (6/30/21): Nerve theorems for fixed points of neural networks
A fundamental question in computational neuroscience is to understand how the network’s connectivity shapes neural activity. A popular framework for modeling neural activity are a class of recurrent neural networks called threshold linear networks (TLNs). A special case of these are comb
From playlist AATRN 2021
Lecture 23 - Cook's Theorem & Harder Reductions
This is Lecture 23 of the CSE373 (Analysis of Algorithms) taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 1997. The lecture slides are available at: http://www.cs.sunysb.edu/~algorith/video-lectures/1997/lecture25.pdf
From playlist CSE373 - Analysis of Algorithms - 1997 SBU
MIT 6.042J Mathematics for Computer Science, Spring 2015 View the complete course: http://ocw.mit.edu/6-042JS15 Instructor: Albert R. Meyer 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.042J Mathematics for Computer Science, Spring 2015
Graph Theory: 27. Hamiltonian Graphs and Problem Set
I define a Hamilton path and a Hamilton cycle in a graph and discuss some of their basic properties. Then I pose three questions for the interested viewer. Solutions are in the next video. An introduction to Graph Theory by Dr. Sarada Herke. Related Videos: http://youtu.be/3xeYcRYccro -
From playlist Graph Theory part-5
CSE 373 --- Lecture 26, Fall 2020
From playlist CSE 373 -- Fall 2020
New to GeoGebra Notes: Ruler & Protractor!
🎉 New to #GeoGebra Notes: Ruler & protractor! Also, when you drag the pen along the side of the ruler, it creates a straight segment! https://www.geogebra.org/notes
From playlist New Features and Releases