RUS  ENG
Full version
JOURNALS // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika // Archive

Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2010 Number 4, Pages 33–39 (Mi vmumm798)

Mathematics

Recovering fourier coefficients of some functions and factorization of integer numbers

S. N. Preobrazhenskii

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: It is shown that if a function defined on the segment $[-1,1]$ has sufficiently good approximation by partial sums of the Legendre polynomial expansion, then, given the function's Fourier coefficients $c_n$ for some subset of $n\in[n_1,n_2]$, one can approximately recover them for all $n\in[n_1,n_2]$. As an application, a new approach to factoring of integers is given.

Key words: computational number theory, complexity of computing, algorithm, factorization, factoring of integers, elliptic curves, modular forms, Fourier coefficients, Legendre polynomials.

UDC: 511

Received: 25.12.2009



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024