What is the use of the convolution theorem in multiplying large numbers?

John Creighto
Messages
487
Reaction score
2
I had this dumb though the other day. I can't help wonder if there would ever be a reason to use the convolution theorem to multiply large numbers. It is used to multiply polynomials. But you would need an awful lot of digits to get any efficiency advantages from it and it would not take care of the carry part of the operation.
 
Physics news on Phys.org
HallsofIvy said:
You might also want to look at this Wikipedia article:
http://en.wikipedia.org/wiki/Fourier_analysis

Okay, interesting. It seems that they use something like it for a prime number search.

http://en.wikipedia.org/wiki/Great_Internet_Mersenne_Prime_Search

However, there are perhaps superior methods since number theoretic transforms avoid rounding errors:
http://en.wikipedia.org/wiki/Multiplication_algorithm#Fourier_transform_methods
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'

Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'

This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
View full post »

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'About the existence of Hamel basis for vector spaces'

It is well known that a vector space always admits an algebraic (Hamel) basis. This is a theorem that follows from Zorn's lemma based on the Axiom of Choice (AC). Now consider any specific instance of vector space. Since the AC axiom may or may not be included in the underlying set theory, might there be examples of vector spaces in which an Hamel basis actually doesn't exist ?
View full post »

Similar threads

What is the fastest algorithm for finding large prime numbers?
Replies
14
Views
3K
Multiplying Big Numbers Using FFT
Replies
1
Views
2K
A Question About Prime Numbers and Goldbach's Conjecture
Replies
6
Views
7K
I Can This Formula Identify All Prime Numbers?
Replies
2
Views
1K
Multiplying Complex Numbers: Understanding the Two Methods
Replies
4
Views
3K
B How can hyperreal numbers make infinitesimals logically sound in calculus?
Replies
24
Views
6K
I Does the Wigner-Eckart theorem require good quantum numbers?
Replies
2
Views
2K
Number of unique ways of stacking n blocks
Replies
3
Views
2K
Small numbers, large numbers, and very large numbers
Replies
7
Views
5K
Is my understanding of the Nyquist theorem correct?
Replies
4
Views
2K

Hot Threads

Recent Insights

Back
Top