9 citations · 20 across the 20 of their papers we have counts for
Showing 2006 · math.NTShow all
3 papers · 2 filters
math.NT2006★ 3 cited
A Comment on Matiyasevich's Identity #0102 with Bernoulli Numbers
H. Gopalkrishna Gadiyar, R. Padma
We connect and generalize Matiyasevich's identity #0102 with Bernoulli numbers and an identity of Candelpergher, Coppo and Delabaere on Ramanujan summation of the divergent series…
math.NT2006
What is the Inverse of Repeated Square and Multiply Algorithm?
H. Gopalkrishna Gadiyar, K M Sangeeta Maini, R. Padma +1
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse whic…
math.NT2006★ 9 cited
Linking the Circle and the Sieve: Ramanujan - Fourier Series
H. Gopalkrishna Gadiyar, R. Padma
Currently the circle and the sieve methods are the key tools in analytic number theory. In this paper the unifying theme of the two methods is shown to be the Ramanujan - Fourier s…