Library / /259 of 520
Number theory Difficulty 6.1 National olympiad Prove it
Theorem 1.5. Given a positive number ϵ>0, there is an algorithm for multiplication of two n-bit integers using O(n1+ϵ) bit operations.
Solution
Want a route through all this instead of an archive?
The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.