Files
DTU-Noter/Diskret Mat/Primes and the Euclidean algorithm/Primes and the Eucledian algorithm.typ

21 lines
426 B
Typst

#import "@local/dtu-template:0.5.1":*
#show: dtu-note.with(
course: "01017",
course-name: "Discrete Mathematics",
title: "Primes and the Eucledian algorithm",
date: datetime(day: 27, month: 11, year: 2025),
author: "Rasmus Rosendahl-Kaa (S255955)",
semester: "2025 Fall",
)
= Primes
#definition()[
$
a,b,c in ZZ, a in ZZ_+
$
If $a = b dot c$ then $a$ is _composite_ (sammensat), if not, then $a$ is a prime,
]