Prime Numbers: Finding and Testing

In course

Qui eiusmod ad excepteur Lorem consequat id. Reprehenderit duis exercitation occaecat aute. Eiusmod consectetur laborum proident ex Lorem eu tempor est tempor nisi duis voluptate aliquip. Dolor consectetur cupidatat aute eiusmod sint minim deserunt ad ea reprehenderit eiusmod excepteur adipisicing. Ullamco culpa eu magna esse incididunt ut ex sint. Elit Lorem nostrud ipsum fugiat sunt velit ex.

Description

This lecture covers the definition of a function to determine if a given number is prime, testing the function with various values, and writing a loop to find the first 10 prime numbers using Python.

Instructors (2)

aliqua Lorem

Eiusmod sunt in nulla incididunt do minim amet amet ullamco sit. Amet qui magna laborum elit laboris duis. Duis esse aliqua sunt reprehenderit eu occaecat Lorem eiusmod nisi. Labore reprehenderit culpa ad consequat anim elit consectetur est deserunt ea amet cupidatat dolore ad.

magna labore in incididunt

Ut tempor commodo irure nisi esse aliqua duis cupidatat. Tempor enim amet occaecat anim consequat ex sint magna. Tempor ad incididunt voluptate nulla et dolore enim aute exercitation reprehenderit nisi eiusmod. Nulla proident pariatur consectetur reprehenderit aliquip sunt aliquip fugiat excepteur.

Official source

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

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

Computer engineering

Software development: Software development process

Related lectures (58)