Lecture

Primes: Fundamental Theorem and Sieve of Eratosthenes

In course

Anim sit ipsum reprehenderit consectetur do ipsum commodo qui culpa. Elit cupidatat adipisicing cupidatat in eu voluptate magna minim do est reprehenderit minim. Non ad nostrud do enim. Excepteur elit quis aliqua proident dolor ad. Irure ea aute cillum cillum quis commodo.

Description

This lecture covers the definition of primes and composites, the Fundamental Theorem of Arithmetic stating that any integer greater than 1 can be written as a product of primes, the proof of this theorem using strong induction, trial division for composite integers, the Sieve of Eratosthenes for finding primes, and Euclid's Theorem proving the infinitude of primes.

Official source

https://mediaspace.epfl.ch/media/0_eluu0rhi

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Number theory: Topics in number theory

Related lectures (30)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.