Related papers: The fastest series for $1/\pi$ due to Ramanujan. P…

A prime p is called Sophie Germain prime if 2p+1 is also prime. A formula for the density of such primes is given in a more general setting using a new approach. This method uses the Ramanujan-Fourier series for a modified von Mangoldt…

We generalize the patterns of supercongruences of Ramanujan-type observed by L. Van Hamme and W. Zudilin to series involving simple square roots anywhere and not only in the result of the sum. To support our observations we give some…

The performance of numerical micromagnetic models is limited by the demagnetizing field computation, which typically accounts for the majority of the computation time. For magnetization dynamics simulations explicit evaluation methods are…

Applying the triplicate form of the extended Gould--Hsu inverse series relations to Dougall's summation theorem for the well--poised $_7F_6$-series, we establish, from the dual series, several interesting Ramanujan--like infinite series…

Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a quantum algorithm of Arvind et al.…

Properties of theta functions and Eisenstein series dating to Jacobi and Ramanujan are used to deduce differential equations associated with McKay Thompson series of level 20. These equations induce expansions for modular forms of level 20…

We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…

Loop acceleration can be used to prove safety, reachability, runtime bounds, and (non-)termination of programs. To this end, a variety of acceleration techniques has been proposed. However, so far all of them have been monolithic, i.e., a…

The Ramanujan Machine project predicts new continued fraction representations of numbers expressed by important mathematical constants. Generally, the value of a continued fraction is found by reducing it to a second order linear difference…

We derive B\'ezout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity profile. We give a new proof of Rueppel's conjecture and…

Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.

Let $p_{r,s}(n)$ denote the number of partitions of a positive integer $n$ into parts containing no multiples of $r$ or $s$, where $r>1$ and $s>1$ are square-free, relatively prime integers. We use classical methods to derive a…

Polynomial system solving has seen major progress in both theory and practice over the past decade. A landmark achievement was addressing Smale's 17th problem, establishing average-case polynomial-time algorithms for computing approximate…

This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…

In this short research note, we aim to establish an interesting extension of a summation due to Ramanujan.The result is derived with the help of an extension of Gauss's summation theorem available in the literature.

We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…

In this paper we develop a method to calculate the overpartition function efficiently using a Hardy-Rademacher-Ramanujan type formula, and we use this method to find many new Ramanujan-style congruences, whose existence is predicted by…

For a binomial random variable $\xi$ with parameters $n$ and $b/n$, it is well known that the median equals $b$ when $b$ is an integer. In 1968, Jogdeo and Samuels studied the behaviour of the relative difference between ${\sf P}(\xi=b)$…

Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…