1,010,010,101,000,011 - #MegaFavNumbers
This is my submission to the #megafavnumbers project. My number is 1010010101000011, which is prime in bases 2, 3, 4, 5, 6 and 10. I've open-sourced my code: https://bitbucket.org/Bip901/multibase-primes Clarification: by "ignoring 1" I mean ignoring base 1, since this number cannot be fo
From playlist MegaFavNumbers
a problem dealing with whole number sets
From playlist Common Core Standards - 7th Grade
A number pattern that results in numbers with 8 for a digit
From playlist Number Patterns
Representation of Whole Numbers on the Number Line | Don't Memorise
In this video, we will learn to plot whole numbers on the number line. Also, we will learn about the order of numbers on the number line & in the end, we will find out the uses of the number line. To learn more about Whole Numbers, enrol in our full course now: https://bit.ly/WholeNumbers
From playlist Whole Numbers Class 06
How to find the five number summary for a set of ODD numbers. Finding min, max, median, Q1 and Q3 in simple steps.
From playlist Basic Statistics (Descriptive Statistics)
Practice multiplying negatives
Quick examples dealing with the multiplication of positive and negative whole numbers, decimals and mixed numbers
From playlist Middle School - Worked Examples
Different Types of Numbers on the number line, lesson 1 #shorts
Watch the full playlist: https://www.youtube.com/watch?v=kcxK3_sROZA&list=PL14bv5vXK2WWuODhGbpPQA0GamV5ohOVb&index=1 Natural Numbers (N), (also called positive integers, counting numbers, or natural numbers); They are the numbers {1, 2, 3, 4, 5, …} Whole Numbers (W). This is the set of na
From playlist Celebrities Teach Math: The Number System
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
Vertex Covering Number of Complete Graphs | Graph Theory Exercises
We discuss and prove the vertex covering number of a complete graph Kn is n-1. That is, the minimum number of vertices needed to cover a complete graph is one less than its number of vertices. This is because, put simply, if we are missing at least 2 vertices in our attempted vertex cover,
From playlist Graph Theory Exercises
This is Lecture 22 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/lecture24.pdf
From playlist CSE373 - Analysis of Algorithms - 1997 SBU
This video contains the solution to just one question because it took me a lot longer than it should have. By that I mean that I ended up solving it quickly using a method that was, to me, standard, but only after being a bit side-tracked by the idea that I was searching for a colouring, a
From playlist Thinking about maths problems in real time: colouring problems
CSE 373 -- Lecture 25, Fall 2020
From playlist CSE 373 -- Fall 2020
Winnie Li: Unramified graph covers of finite degree
Abstract: Given a finite connected undirected graph X, its fundamental group plays the role of the absolute Galois group of X. The familiar Galois theory holds in this setting. In this talk we shall discuss graph theoretical counter parts of several important theorems for number fields. T
From playlist Women at CIRM
NP Completeness III - More Reductions - Lecutre 17
All rights reserved for http://www.aduni.org/ Published under the Creative Commons Attribution-ShareAlike license http://creativecommons.org/licenses/by-sa/2.0/ Tutorials by Instructor: Shai Simonson. http://www.stonehill.edu/compsci/shai.htm Visit the forum at: http://www.coderisland.c
From playlist ArsDigita Algorithms by Shai Simonson
1. Colouring problems 1-6 from Problem-Solving Strategies by Arthur Engel.
I have finished the problems from Chapter 1 of Arthur Engel's book, so here I move on to Chapter 2. It concerns problems -- so far questions about whether certain shapes can be used to tile other shapes -- that are solved by finding suitable colourings to demonstrate impossibility. There a
From playlist Thinking about maths problems in real time: colouring problems
NP Completeness IV - Lecture 18
All rights reserved for http://www.aduni.org/ Published under the Creative Commons Attribution-ShareAlike license http://creativecommons.org/licenses/by-sa/2.0/ Tutorials by Instructor: Shai Simonson. http://www.stonehill.edu/compsci/shai.htm Visit the forum at: http://www.coderisland.c
From playlist ArsDigita Algorithms by Shai Simonson
Exploring an amazing pattern that forms when we multiply numbers built only with the one digit
From playlist Number Patterns
Irene Bouw, Belyi maps in positive characteristic
VaNTAGe seminar, September 28, 2021 License: CC-BY-NC-SA
From playlist Belyi maps and Hurwitz spaces