ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

1,102 results

Andrew Misseldine
Modular Arithmetic as an Equivalence Relations

In this video, we introduce modular congruence and show this is an equivalence relation. This is lecture 4 (part 4/4) of the lecture ...

14:47
Modular Arithmetic as an Equivalence Relations

860 views

5 years ago

Steven Gordon
Basics of Primes and Modular Arithmetic (CSS322, L10, Y14)

introduction to number theory for public key crypto. Divisibility, factors, primes, relatively prime. Addition, subtraction, multiplication ...

1:19:48
Basics of Primes and Modular Arithmetic (CSS322, L10, Y14)

7,656 views

10 years ago

Computer Engineering Jitty
Introduction to Modular Arithmetic - Discrete Math

In this video, Jitty introduces the modulo operation and explains how to calculate the modulus of positive and negative numbers.

21:03
Introduction to Modular Arithmetic - Discrete Math

129 views

2 months ago

Douglas Weathers
Modular arithmetic

A special equivalence relation is that of congruence on the integers. Meant to be watched before or after reading Chapter 17 of ...

4:55
Modular arithmetic

465 views

5 years ago

Andrew Misseldine
Modular Arithmetic - Part 1

In this video, we introduce the notion of integers modulo n. We present some examples, prove some basic algebraic properties, ...

26:15
Modular Arithmetic - Part 1

330 views

3 years ago

SI335 SI335
(Bonus) Proof of modular inverse formula
7:25
(Bonus) Proof of modular inverse formula

20 views

4 years ago

NPTEL IIT Bombay
Week 3-Lecture 12 : Arithmetic modulo n, more examples

Week 3-Lecture 12 : Arithmetic modulo n, more examples.

28:05
Week 3-Lecture 12 : Arithmetic modulo n, more examples

5,300 views

5 years ago

Jeremy Teitelbaum
The Integers mod N

A quick introduction to the integers modulo N. See https://jeremy9959.net/2021-Fall-3230-Math/notes/01-groups/modN.given.pdf.

23:23
The Integers mod N

758 views

4 years ago

SI335 SI335
Unit 3 Class 12: Euclidean Algorithm

We learn how to compute GCDs quickly using a 2300-year-old method. Then we see how to do a small "add-on" to also get the ...

24:29
Unit 3 Class 12: Euclidean Algorithm

117 views

4 years ago

Number Theory Web Seminar
James Maynard: Primes in arithmetic progressions to large moduli (NTWS 018)

Abstract: How many primes are there which are less than x and congruent to a modulo q? This is one of the most important ...

55:53
James Maynard: Primes in arithmetic progressions to large moduli (NTWS 018)

370 views

2 years ago

Andrew Snowden
Math 679 / Lecture 13: Modular forms

See http://www-personal.umich.edu/~asnowden/teaching/2013/679/L13.html for notes.

1:20:53
Math 679 / Lecture 13: Modular forms

5,951 views

12 years ago

SI335 SI335
Unit 3 Class 11: Modular Arithmetic

Doing operations "mod m" is at the heart of many cryptographic applications. We look at what this means exactly and how some ...

19:37
Unit 3 Class 11: Modular Arithmetic

104 views

4 years ago

NPTEL IIT Bombay
Week 3-Lecture 11 : Arithmetic modulo n, theory and examples

Week 3-Lecture 11 : Arithmetic modulo n, theory and examples.

32:46
Week 3-Lecture 11 : Arithmetic modulo n, theory and examples

6,673 views

5 years ago

Jim Fowler
When 𝑝 ≡ 1 (mod 5), what is (5 | 𝑝)? — The Ross Program

We begin our quest to understand (𝑞 | 𝑝), i.e., when is 𝑞 a square modulo 𝑝? When 𝑝 ≡ 1 (mod 5), we consider (5 | 𝑝), and ...

7:56
When 𝑝 ≡ 1 (mod 5), what is (5 | 𝑝)? — The Ross Program

1,631 views

5 years ago

David Tweedle
Math 2400 - units modulo m
6:03
Math 2400 - units modulo m

100 views

4 years ago

The Random Professor
Inverses, mod N

Finding the inverse of a number mod N. For more math, subscribe to my channel: https://www.youtube.com/jeffsuzuki1.

3:47
Inverses, mod N

1,147 views

6 years ago

Computer Engineering Jitty
Introduction to Axioms for Proofs - Divisibility, Modulo, Parity, Integers - Discrete Math

In this video, Jitty covers the axioms you would need to know to do proofs in discrete math or proof courses. He talks about ...

15:22
Introduction to Axioms for Proofs - Divisibility, Modulo, Parity, Integers - Discrete Math

60 views

2 months ago

Andrew Snowden
Math 679 / Lecture 12: Modular curves over C

See http://www-personal.umich.edu/~asnowden/teaching/2013/679/L12.html for notes.

1:06:02
Math 679 / Lecture 12: Modular curves over C

2,000 views

12 years ago

Jim Fowler
Can we replace equivalent things for equivalent things? — The Ross Program

We know 12 ≡ 2 mod 10 and 13 ≡ 3 mod 10, but does that mean that 12¹³ ≡ 2³ mod 10? When can we replace "equivalent" ...

5:01
Can we replace equivalent things for equivalent things? — The Ross Program

365 views

5 years ago

VaNTAGe
Chandrashekhar Khare, Serre's conjecture and computational aspects of the Langlands program

VaNTAGe Seminar, April 5, 2022 License: CC-BY-NC-SA Some relevant links: Edixhoven-Couveignes-de Jong-Merkl-Bosman: ...

1:00:46
Chandrashekhar Khare, Serre's conjecture and computational aspects of the Langlands program

402 views

3 years ago