Related Experiment Video
Updated: Aug 17, 2025

Observation and Analysis of Blinking Surface-enhanced Raman Scattering
Published on: January 11, 2018
Summing : a faster elementary algorithm
Harald Andrés Helfgott1,2, Lola Thompson3
1Mathematisches Institut, Georg-August Universität Göttingen, Bunsenstraße 3-5, 37073 Göttingen, Germany.
Abstract:
We present a new elementary algorithm that takes (measured bitwise) for computing where is the Möbius function. This is the first improvement in the exponent of x for an elementary algorithm since 1985. We also show that it is possible to reduce space consumption to by the use of (Helfgott in: Math Comput 89:333-350, 2020), at the cost of letting time rise to the order of .
More Related Videos
10:58Multimedia Battery for Assessment of Cognitive and Basic Skills in Mathematics BM-PROMA
Published on: August 28, 2021
09:01Gain-compensation Methodology for a Sinusoidal Scan of a Galvanometer Mirror in Proportional-Integral-Differential Control Using Pre-emphasis Techniques
Published on: April 4, 2017
Related Concept Videos
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Euler's Formula to Columns: Problem Solving
The system comprises two vertical rigid bars, AB and BC,...
Exponential Fourier series
Euler's identity...
Vector Algebra: Method of Components
In many applications, the magnitudes and directions of...
Convergence of Fourier Series
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...