Multiplicative functions | Unsolved problems in number theory | Conjectures
In mathematics, Carmichael's totient function conjecture concerns the multiplicity of values of Euler's totient function φ(n), which counts the number of integers less than and coprime to n. It states that, for every n there is at least one other integer m ≠ n such that φ(m) = φ(n).Robert Carmichael first stated this conjecture in 1907, but as a theorem rather than as a conjecture. However, his proof was faulty, and in 1922, he retracted his claim and stated the conjecture as an open problem. (Wikipedia).
Introduction to Euler's Totient Function!
Euler's totient function φ(n) is an important function in number theory. Here we go over the basics of the definition of the totient function as well as the value for prime numbers and powers of prime numbers! Modular Arithmetic playlist: https://www.youtube.com/playlist?list=PLug5ZIRrShJ
From playlist Modular Arithmetic
Introduction to number theory lecture 14. Euler's totient function
This lecture is part of my Berkeley math 115 course "Introduction to number theory" For the other lectures in the course see https://www.youtube.com/playlist?list=PL8yHsr3EFj53L8sMbzIhhXSAOpuZ1Fov8 We cover the basic properties of Euler's totient function. The textbook is "An introducti
From playlist Introduction to number theory (Berkeley Math 115)
Weil conjectures 1 Introduction
This talk is the first of a series of talks on the Weil conejctures. We recall properties of the Riemann zeta function, and describe how Artin used these to motivate the definition of the zeta function of a curve over a finite field. We then describe Weil's generalization of this to varie
From playlist Algebraic geometry: extra topics
Reciprocals, powers of 10, and Euler's totient function II | Data Structures Math Foundations 203
We introduce the idea of the unit group U(n) of a natural number n. This is an algebraic object that contains important data about how multiplication mod n works, even for a composite number n. There is a natural connection with Euler's totient function, and we will see how to exploit this
From playlist Math Foundations
Number Theory | The Multiplicativity of Euler's Totient Function
We state and prove when Euler's totient function is multiplicative. http://www.michael-penn.net
From playlist Number Theory
Explicit Formula for Euler's Totient Function!
Totient of p^a: https://youtu.be/NgZ33qr5WHM?t=210 Product formula: https://youtu.be/qpYqvNBQZ4g Euler's totient function involves counting how many numbers are coprime to n. In fact, we can calculate this value directly as long as we know the prime factors! This makes many theorems in n
From playlist Modular Arithmetic
Some identities involving the Riemann-Zeta function.
After introducing the Riemann-Zeta function we derive a generating function for its values at positive even integers. This generating function is used to prove two sum identities. http://www.michael-penn.net http://www.randolphcollege.edu/mathematics/
From playlist The Riemann Zeta Function
Discrete Math You Need to Know - Tim Berglund
From OSCON 2013: What do you need to know about prime numbers, Markov chains, graph theory, and the underpinnings of public key cryptography? Well, maybe more than you think! In this talk, we'll explore the branch of mathematics that deals with separate, countable things. Most of the math
From playlist Open Source Convention (OSCON) 2013
Number Theory | Euler's Totient Function: Definition and Basic Example
We define Euler's totient function and give some basic examples. http://www.michael-penn.net
From playlist Mathematics named after Leonhard Euler
A History of Primes - Manindra Agrawal [2002]
2002 Annual Meeting Clay Math Institute Manindra Agrawal, American Academy of Arts and Sciences, October 2002
From playlist Number Theory
CTNT 2018 - "L-functions and the Riemann Hypothesis" (Lecture 4) by Keith Conrad
This is lecture 4 of a mini-course on "L-functions and the Riemann Hypothesis", taught by Keith Conrad, 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 - "L-functions and the Riemann Hypothesis" by Keith Conrad
Number Theory 1.1 : Product Formula for the Zeta Function
In this video, I prove Euler's product formula for the Riemann Zeta function. Email : fematikaqna@gmail.com Code : https://github.com/Fematika/Animations Notes : None yet
From playlist Number Theory
William Banks: Primes, exponential sums, and L-functions
Abstract: This talk will survey some recent directions in the study of prime numbers that rely on bounds of exponential sums and advances in sieve theory. I will also describe some new results on the Riemann zeta function and Dirichlet functions, and pose some open problems. Recording dur
From playlist Number Theory
Primes, exponential sums, and L functions - William Banks (2016)
March 30, 2016
From playlist Mathematics
#SoME1 This video was made by Chino Cribioli, Juli Garbulsky and Bruno Giordano
From playlist Summer of Math Exposition Youtube Videos
How prime numbers protect your privacy #SoME2
Most of us have probably heard about encryption before, but have you ever wondered how it works? This video explores the math behind the RSA cryptosystem, a very popular encryption method that set the stage for asymmetric cryptography. ► Join my Discord server: https://discord.gg/FJqqvqHa
From playlist Summer of Math Exposition 2 videos
Jeffrey Lagarias: Splitting measures on polynomials and the field with one element
The lecture was held within the framework of the Hausdorff Trimester Program: Non-commutative Geometry and its Applications and the Workshop: Number theory and non-commutative geometry 26.11.2014
From playlist HIM Lectures: Trimester Program "Non-commutative Geometry and its Applications"
Mark Pollicott - Dynamical Zeta functions (Part 2)
Dynamical Zeta functions (Part 1) Licence: CC BY NC-ND 4.0
From playlist École d’été 2013 - Théorie des nombres et dynamique
DATE & TIME 05 November 2016 to 14 November 2016 VENUE Ramanujan Lecture Hall, ICTS Bangalore Computational techniques are of great help in dealing with substantial, otherwise intractable examples, possibly leading to further structural insights and the detection of patterns in many abstra
From playlist Group Theory and Computational Methods