Number theory | Computational number theory

Computational number theory

In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory and arithmetic geometry, including algorithms for primality testing and integer factorization, finding solutions to diophantine equations, and explicit methods in arithmetic geometry.Computational number theory has applications to cryptography, including RSA, elliptic curve cryptography and post-quantum cryptography, and is used to investigate conjectures and open problems in number theory, including the Riemann hypothesis, the Birch and Swinnerton-Dyer conjecture, the ABC conjecture, the modularity conjecture, the Sato-Tate conjecture, and explicit aspects of the Langlands program. (Wikipedia).

Video thumbnail

Number theory Full Course [A to Z]

Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure #mathematics devoted primarily to the study of the integers and integer-valued functions. Number theorists study prime numbers as well as the properties of objects made out of integers (for example, ratio

From playlist Number Theory

Video thumbnail

Prove that there is a prime number between n and n!

A simple number theory proof problem regarding prime number distribution: Prove that there is a prime number between n and n! Please Like, Share and Subscribe!

From playlist Elementary Number Theory

Video thumbnail

Intro to Number Theory and The Divisibility Relation

This video introduces the divisibility relation and provided several examples. mathispower4u.com

From playlist Additional Topics: Generating Functions and Intro to Number Theory (Discrete Math)

Video thumbnail

Theory of numbers:Introduction

This lecture is part of an online undergraduate course on the theory of numbers. This is the introductory lecture, which gives an informal survey of some of the topics to be covered in the course, such as Diophantine equations, quadratic reciprocity, and binary quadratic forms.

From playlist Theory of numbers

Video thumbnail

The Prime Number Theorem, an introduction ← Number Theory

An introduction to the meaning and history of the prime number theorem - a fundamental result from analytic number theory. Narrated by Cissy Jones Artwork by Kim Parkhurst, Katrina de Dios and Olga Reukova Written & Produced by Michael Harrison & Kimberly Hatch Harrison ♦♦♦♦♦♦♦♦♦♦ Ways t

From playlist Number Theory

Video thumbnail

Computational Number Theory - Lecture 1/4 by Harris Daniels [CTNT 2018]

Full playlist: https://www.youtube.com/playlist?list=PLJUSzeW191QxlmJmz1glCXN0AF-VhXi-G ‌ Mini-course D: “Computational Number Theory” by Harris Daniels (Amherst College). Both Magma and Sage/CoCalc are extremely useful computer algebra packages for doing research in number theory. The

From playlist Number Theory

Video thumbnail

Introduction to Number Theory (Part 4)

The Euclidean algorithm is established and Bezout's theorem is proved.

From playlist Introduction to Number Theory

Video thumbnail

CTNT 2018 - "Computational Number Theory" (Lecture 2) by Harris Daniels

This is lecture 2 of a mini-course on "Computational Number Theory", taught by Harris Daniels, during CTNT 2018, the Connecticut Summer School in Number Theory. For more information about CTNT and other resources and notes, see https://ctnt-summer.math.uconn.edu/

From playlist CTNT 2018 - "Computational Number Theory" by Harris Daniels

Video thumbnail

A Short Course in Algebra and Number Theory - Elementary Number Theory

To supplement a course taught at The University of Queensland's School of Mathematics and Physics I present a very brief summary of algebra and number theory for those students who need to quickly refresh that material or fill in some gaps in their understanding. This is the fourth lectu

From playlist A Short Course in Algebra and Number Theory

Video thumbnail

Computing Reality (Lecture - 01) by David B Kaplan

Nonperturbative and Numerical Approaches to Quantum Gravity, String Theory and Holography DATE:27 January 2018 to 03 February 2018 VENUE:Ramanujan Lecture Hall, ICTS Bangalore The program "Nonperturbative and Numerical Approaches to Quantum Gravity, String Theory and Holography" aims to

From playlist Nonperturbative and Numerical Approaches to Quantum Gravity, String Theory and Holography

Video thumbnail

Emergent geometry: The duality between gravity and quantum field theory - Juan Maldacena

Emergent geometry: The duality between gravity and quantum field theory - Juan Maldacena Juan Maldacena Institute for Advanced Study; Faculty, School of Natural Science February 20, 2014 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

An Introduction to Class-S and Tinkertoys (Lecture 2 )by Jacques Distler

Program: Quantum Fields, Geometry and Representation Theory ORGANIZERS : Aswin Balasubramanian, Saurav Bhaumik, Indranil Biswas, Abhijit Gadde, Rajesh Gopakumar and Mahan Mj DATE & TIME : 16 July 2018 to 27 July 2018 VENUE : Madhava Lecture Hall, ICTS, Bangalore The power of symmetries

From playlist Quantum Fields, Geometry and Representation Theory

Video thumbnail

Lenore Blum - Alan Turing and the other theory of computing and can a machine be conscious?

Abstract Most logicians and theoretical computer scientists are familiar with Alan Turing’s 1936 seminal paper setting the stage for the foundational (discrete) theory of computation. Most however remain unaware of Turing’s 1948 seminal paper which introduces the notion of condition, sett

From playlist Turing Lectures

Video thumbnail

Univalence from a computer science point-of-view - Dan Licata

Vladimir Voevodsky Memorial Conference Topic: Univalence from a computer science point-of-view Speaker: Dan Licata Affiliation: Wesleyan University Date: September 14, 2018 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Supersymmetric Gauge Dynamics, Part 1 - Nathan Seiberg

Supersymmetric Gauge Dynamics, Part 1 Nathan Seiberg Institute for Advanced Study July 21, 2010

From playlist PiTP 2010

Video thumbnail

The abstract chromatic number - Leonardo Nagami Coregliano

Computer Science/Discrete Mathematics Seminar I Topic: The abstract chromatic number Speaker: Leonardo Nagami Coregliano Affiliation: University of Chicago Date: March 22, 2021 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

The Abel lectures: László Lovász and Avi Wigderson

0:30 Introduction by the Abel Prize Committee Chair, Hans Munthe-Kaas 02:42 László Lovász: Continuous limits of finite structures 49:27 Questions and answers 1:00:31 Avi Wigderson: The Value of Errors in Proofs 1:41:24 Questions and answers 1:50:20 Final remarks by John Grue, Chair of the

From playlist Abel Lectures

Video thumbnail

Introduction to Number Theory, Part 1: Divisibility

The first video in a series about elementary number theory, following the book by Underwood Dudley. We define the basic concept of divisibility, and prove a fundamental lemma. Intro:(0:00) Definition of Divisibility:(6:40) Our First Theorem:(9:00)

From playlist Introduction to Number Theory

Video thumbnail

Anne Baanen - Computing with or despite the computer - IPAM at UCLA

Recorded 14 February 2023. Anne Baanen of Vrije Universiteit presents "Computing with or despite the computer" at IPAM's Machine Assisted Proofs Workshop. Abstract: I have recently been collaborating on a project where we compute the class number of quadratic number fields, formally verifi

From playlist 2023 Machine Assisted Proofs Workshop

Related pages

Birch and Swinnerton-Dyer conjecture | SageMath | Integer factorization | Modularity theorem | Number Theory Library | Post-quantum cryptography | Mathematics | RSA (cryptosystem) | PARI/GP | Computation | Langlands program | Arithmetic geometry | Riemann hypothesis | Fast Library for Number Theory | Cryptography | Number theory