Тёмный

Section 5.1 (part 5) - Proving reflexive, symmetric, and transitive 

Pete Kosek
Подписаться 110
Просмотров 7 тыс.
50% 1

I go through proofs and counterexamples for reflexive, symmetric, and transitive.

Опубликовано:

 

2 апр 2020

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 2   
@demobreyngwira4440
@demobreyngwira4440 Год назад
Thanks for this wonderful lesson
@cyrrender
@cyrrender Год назад
Hello, thank you for this video! You are the only person I’ve come across that shows the relations in a set written that way (as in without ordered pairs.) Do you know what this is called exactly? I am trying to understand how I can figure out whether a relation like this R = {a,b ∈ ℤ ∧ |a-b| ≤ 3} is reflexive, symmetric, and/or transitive. I can already tell it’s reflexive (I think) but I’m not sure how to show whether or not it’s symmetric and/or transitive. Help or guidance would be much appreciated. Cheers!
Далее
What turned out better to repeat? #tiktok
00:16
Просмотров 2,4 млн
Proving that divisibility is transitive
11:09
Просмотров 31 тыс.
Types of Relations (Solved Problem)
9:06
Просмотров 83 тыс.
An Introduction to Mathematical Proofs
9:41
Просмотров 79 тыс.
Intro to Relations | Discrete Math
12:53
Просмотров 9 тыс.
RELATIONS - DISCRETE MATHEMATICS
15:36
Просмотров 905 тыс.
Equivalence Relations: Sample Problems
7:48
Просмотров 38 тыс.
Reflexive, Symmetric, Transitive Tutorial
16:15
Просмотров 184 тыс.