/explore
|
You are here 
|
kpknudson.com | ||
| | | | |
www.jeremykun.com
|
|
| | | | | Problem: Show there are finitely many primes. "Solution": Suppose to the contrary there are infinitely many primes. Let $ P$ be the set of primes, and $ S$ the set of square-free natural numbers (numbers whose prime factorization has no repeated factors). To each square-free number $ n \in S$ there corresponds a subset of primes, specifically the primes which make up $ n$'s prime factorization. Similarly, any subset $ Q \subset P$ of primes corresponds to a number in $ S$, since we can simply multiply all numbers in $ Q$ together to get a square-free number. | |
| | | | |
mathbabe.org
|
|
| | | | | A continuation ofthis, where I take notes on my workshop atHCSSiM. The real numbers are uncountable Today we used Cantor's diagonal argument to prove that the real numbers aren't countable. Namely, we assumed they were, and that we had a bijection $latex f: \mathbb{N} \rightarrow \mathbb{R}$ and then proved it didn't contain the real number... | |
| | | | |
thatsmaths.com
|
|
| | | | | In last week's post, we defined an extension of parity from the integers to the rational numbers. Three parity classes were found --- even, odd and none. This week, we show that, with an appropriate ordering or enumeration of the rationals, the three classes are not only equinumerate (having the same cardinality) but of equal... | |
| | | | |
apoorvasrinivasanblog.com
|
|
| | | [AI summary] This blog post introduces the concept of hypothesis testing in statistics, explaining its purpose, key components, and steps to conduct a hypothesis test using an example about coffee and height. | ||
