Search
1000 results for “discrete”
-
Alright, future engineers!
**Pigeonhole Principle:** If `n` items are put into `m` containers, and `n > m`, then at least one container must contain more than one item.
Ex: 7 emails into 6 folders means one folder has >1 email.
Pro-Tip: A powerful proof technique for existence!
#DiscreteMath #Logic #STEM #StudyNotes -
Alright, future engineers!
**Pigeonhole Principle:** If `n` items are put into `m` containers, and `n > m`, then at least one container must contain more than one item.
Ex: 7 emails into 6 folders means one folder has >1 email.
Pro-Tip: A powerful proof technique for existence!
#DiscreteMath #Logic #STEM #StudyNotes -
Alright, future engineers!
**Combinations:** Ways to *choose* items from a set where the order *doesn't* matter.
Ex: Picking 3 teammates from 5 friends: `C(5,3) = 10` ways.
Pro-Tip: If swapping items doesn't create a new outcome, it's a combination!
#DiscreteMath #Combinatorics #STEM #StudyNotes -
Alright, future engineers!
**Combinations:** Ways to *choose* items from a set where the order *doesn't* matter.
Ex: Picking 3 teammates from 5 friends: `C(5,3) = 10` ways.
Pro-Tip: If swapping items doesn't create a new outcome, it's a combination!
#DiscreteMath #Combinatorics #STEM #StudyNotes -
v0.7.1 — fixes and quality of life improvements
- seeking from control center
- favorite track from control center- fixed 'system' playlists detection for servers running on Windows
- fixed untouchable queue on fullscreen iPad layout
- previous button now available to perform seek to zero even if there's no previous tracks -
v0.7.1 — fixes and quality of life improvements
- seeking from control center
- favorite track from control center- fixed 'system' playlists detection for servers running on Windows
- fixed untouchable queue on fullscreen iPad layout
- previous button now available to perform seek to zero even if there's no previous tracks -
v0.7.1 — fixes and quality of life improvements
- seeking from control center
- favorite track from control center- fixed 'system' playlists detection for servers running on Windows
- fixed untouchable queue on fullscreen iPad layout
- previous button now available to perform seek to zero even if there's no previous tracks -
v0.7.0 — Largest UX update, Lyrics support and new Home page
Check out new look and feel: https://apps.apple.com/us/app/discrete/id6746067740
-
v0.7.0 — Largest UX update, Lyrics support and new Home page
Check out new look and feel: https://apps.apple.com/us/app/discrete/id6746067740
-
v0.7.0 — Largest UX update, Lyrics support and new Home page
Check out new look and feel: https://apps.apple.com/us/app/discrete/id6746067740
-
Alright, future engineers!
**Pigeonhole Principle:** If you have more items than containers, at least one container must contain more than one item. Ex: 5 emails to 4 folders = at least 1 folder gets 2+ emails. Pro-Tip: Think worst-case distribution to guarantee the outcome!
#DiscreteMath #Logic #STEM #StudyNotes -
Alright, future engineers!
**Pigeonhole Principle:** If you have more items than containers, at least one container must contain more than one item. Ex: 5 emails to 4 folders = at least 1 folder gets 2+ emails. Pro-Tip: Think worst-case distribution to guarantee the outcome!
#DiscreteMath #Logic #STEM #StudyNotes -
Alright, future engineers!
**Pigeonhole Principle:** If you have more items than containers, at least one container must contain more than one item. Ex: 5 emails to 4 folders = at least 1 folder gets 2+ emails. Pro-Tip: Think worst-case distribution to guarantee the outcome!
#DiscreteMath #Logic #STEM #StudyNotes -
Alright, future engineers!
**Pigeonhole Principle:** If you have more items than containers, at least one container must contain more than one item. Ex: 5 emails to 4 folders = at least 1 folder gets 2+ emails. Pro-Tip: Think worst-case distribution to guarantee the outcome!
#DiscreteMath #Logic #STEM #StudyNotes -
Alright, future engineers!
A **Proposition** is a declarative statement that's definitively true or false. Ex: The sun is hot (True). Pro-Tip: Use **Truth Tables** to analyze compound propositions & evaluate their validity!
#DiscreteMath #Logic #STEM #StudyNotes -
Alright, future engineers!
A **Proposition** is a declarative statement that's definitively true or false. Ex: The sun is hot (True). Pro-Tip: Use **Truth Tables** to analyze compound propositions & evaluate their validity!
#DiscreteMath #Logic #STEM #StudyNotes -
Alright, future engineers!
A **Proposition** is a declarative statement that's definitively true or false. Ex: The sun is hot (True). Pro-Tip: Use **Truth Tables** to analyze compound propositions & evaluate their validity!
#DiscreteMath #Logic #STEM #StudyNotes -
Alright, future engineers!
A **Proposition** is a declarative statement that's definitively true or false. Ex: The sun is hot (True). Pro-Tip: Use **Truth Tables** to analyze compound propositions & evaluate their validity!
#DiscreteMath #Logic #STEM #StudyNotes -
Discrète, encadrée mais vivante : le vrai visage de la petite Église d’Algérie
🗞️ La Croix - 🕐 13/04 06:04
Lorsque le père Théoneste Bazirikana, originaire du Rwanda, est arrivé à Constantine, en Algérie, en 1988, il se souvient avoir découvert « avec une divine surprise » la petite Église catholique du pays. L’étudiant en ingénierie ne s’attendait pas à ... [323 chars]
🔗 https://www.la-croix.com/religion/discrete-encadree-mais-vivante-le-vrai-visage-de-la-petite-eglise-d-algerie-20260412
#actu #news #presse #lacroix -
Alright, future engineers!
**Induction** proves a statement for all natural numbers: 1) Show base case (n=1). 2) Assume true for k. 3) Prove true for k+1. Ex: Sum of 1st N ints is N(N+1)/2. Pro-Tip: Your rigorous way to prove properties for *all* integers!
-
Alright, future engineers!
**Induction** proves a statement for all natural numbers: 1) Show base case (n=1). 2) Assume true for k. 3) Prove true for k+1. Ex: Sum of 1st N ints is N(N+1)/2. Pro-Tip: Your rigorous way to prove properties for *all* integers!
-
Alright, future engineers!
**Induction** proves a statement for all natural numbers: 1) Show base case (n=1). 2) Assume true for k. 3) Prove true for k+1. Ex: Sum of 1st N ints is N(N+1)/2. Pro-Tip: Your rigorous way to prove properties for *all* integers!
-
Alright, future engineers!
**Induction** proves a statement for all natural numbers: 1) Show base case (n=1). 2) Assume true for k. 3) Prove true for k+1. Ex: Sum of 1st N ints is N(N+1)/2. Pro-Tip: Your rigorous way to prove properties for *all* integers!
-
Alright, future engineers!
A **Cartesian Product (A x B)** is the set of all ordered pairs (a,b) where a∈A & b∈B.
Ex: A={1,2}, B={x,y} => A x B = {(1,x),(1,y),(2,x),(2,y)}.
Pro-Tip: It's how you model all possible pairs across two sets! -
Alright, future engineers!
A **Cartesian Product (A x B)** is the set of all ordered pairs (a,b) where a∈A & b∈B.
Ex: A={1,2}, B={x,y} => A x B = {(1,x),(1,y),(2,x),(2,y)}.
Pro-Tip: It's how you model all possible pairs across two sets! -
Alright, future engineers!
A **Cartesian Product (A x B)** is the set of all ordered pairs (a,b) where a∈A & b∈B.
Ex: A={1,2}, B={x,y} => A x B = {(1,x),(1,y),(2,x),(2,y)}.
Pro-Tip: It's how you model all possible pairs across two sets! -
Alright, future engineers!
A **Cartesian Product (A x B)** is the set of all ordered pairs (a,b) where a∈A & b∈B.
Ex: A={1,2}, B={x,y} => A x B = {(1,x),(1,y),(2,x),(2,y)}.
Pro-Tip: It's how you model all possible pairs across two sets! -
Alright, future engineers!
**Modulo Arithmetic** finds the remainder after division. `a mod n = r`. Ex: `17 mod 5 = 2` (since 17 = 3*5 + 2). Pro-Tip: Essential for cryptography, hash functions, & telling time (clock arithmetic)!
-
Alright, future engineers!
**Modulo Arithmetic** finds the remainder after division. `a mod n = r`. Ex: `17 mod 5 = 2` (since 17 = 3*5 + 2). Pro-Tip: Essential for cryptography, hash functions, & telling time (clock arithmetic)!
-
Alright, future engineers!
**Modulo Arithmetic** finds the remainder after division. `a mod n = r`. Ex: `17 mod 5 = 2` (since 17 = 3*5 + 2). Pro-Tip: Essential for cryptography, hash functions, & telling time (clock arithmetic)!