Skip to content

Commit 640f3b3

Browse files
committed
Add new notes from 11.10.2024 and earlier
1 parent 38a6b8a commit 640f3b3

10 files changed

+71
-0
lines changed

notes/20241012151815.md

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
# What parameters are there for floating point number representations?
2+
Floating point number representations $\mathbb{F}$ [[20241010165723]] have 5 parameters.
3+
$\mathbb{F}(b,p,e_{min}, e_{max}, denorm)$.
4+
5+
* b stands for the base of the number
6+
* p stands for the length of the mantissa
7+
* $e_{min}$ stands for the minimal exponent
8+
* $e_{max}$ stands for the maximal exponent
9+
* denorm stands for "this number is denormalized"
10+
11+
#gds #floatingpoint

notes/20241012152108.md

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
# What are the parameters for the IEEE 754 single and double precision number representations?
2+
The parameters for IEEE 754 single and double precision floating point number representations [[20241010165723]] are as follows:
3+
4+
| | single | double |
5+
|-----------|--------|--------|
6+
| b | 2 | 2 |
7+
| p | 24 | 53 |
8+
| $e_{min}$ | -126 | -1022 |
9+
| $e_{max}$ | +127 | +1023 |
10+
| denorm | true | true |
11+
12+
#gds #floatingpoint

notes/20241012152603.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
# What is the implicit first bit?
2+
The implicit first bit refers to the fact, that in floating point number representations [[20241010165723]] the first bit of the mantissa can be left out,
3+
because it is only 0 if the denorm bit is true (so it's always 1 unless denorm is on in which case it is 0).
4+
5+
#gds #floatingpoint

notes/20241012152741.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,4 @@
1+
# What format is the exponent represented in for floating point number representation?
2+
The exponent of floating point number representation [[20241010165723]] is in excess notation/form [[20241010151125]].
3+
4+
#gds #floatingpoint

notes/20241012152927.md

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
# How to convert a number to its floating point representation?
2+
To convert a number $x$ to its floating point representation[[20241010165723]] (base x) do the following:
3+
1. convert the number to the base of your desired representation
4+
2. Normalize (shift so there is only one non-fractional place)
5+
3. calculate the exponent (in excess notation in binary)
6+
4. Set the sign bit and fill the remaining bits of the mantissa with zeroes
7+
8+
This would be what you would get in binary
9+
| 1 bit | 8 bit | 23 bit |
10+
|-------|-----------------------------|----------------------------------------------|
11+
| Sign | exponent in excess notation | Mantissa(remaining space filled with zeroes) |
12+
13+
#gds #floatingpoint

notes/20241012153323.md

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
# What are the different ways to round for floating point numbers?
2+
Rounding floating point numbers to the next numbers in their representation [[20241010165723]] is pretty simple
3+
You calculate the boundary value of $\hat{x}$ which is $\frac{x_{n}+x_{n+1}}{2}$ if the number is larger round it to $x_{n+1}$, if it is smaller round it to $x_n$.
4+
Now you have two possibilities if the value you want to round $x=\hat{x}$:
5+
1. Round away from zero (which means rounding up/down, depending on the sign of the number)
6+
2. Round to even (which means to round to the next number with 0 as the last bit)
7+
8+
#gds #floatingpoint

notes/20241012153856.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
# What is the fundamental axiom of number theory?
2+
Every natural number [[20240910105916]] $x \in \mathbb{N} \leq 2$ is representable as a product of prime [[20241012154438]] numbers. This product is called its prime factorization.
3+
It is unambiguous except for its order.
4+
5+
#math #adm #numbertheory

notes/20241012154438.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,4 @@
1+
# When is a number prime?
2+
A natural number [[20240910105916]] $x \in \mathbb{N}$ is prime if it is only divisible by 1 and itself.
3+
4+
#math #adm #numbertheory

notes/20241012154554.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,4 @@
1+
# What are the prime numbers $\mathbb{P}$?
2+
The prime numbers $\mathbb{P}$ is the set of all natural number [[20240910105916]], that are prime [[20241012154438]].
3+
4+
#math #gds #numbertheory

notes/20241012154721.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
# What is $\nu_p(a)$ ?
2+
$\nu_p(a)$ is a function, that returns how often a specific prime number $p \in \mathbb{P}$ is present in the prime factorization [[20241012153856]] of a number
3+
$a \in \mathbb{N}$
4+
5+
#math #adm #numbertheory

0 commit comments

Comments
 (0)