Methodology of Mathematics Teaching. Treatment to School Mathematics Equations

This book is aimed at pre-university students and its purpose is to contribute to the development of their knowledge related to the algebraic and transcendent equations studied at school, as well as their application to different situations that occur in practice in an innovative and creative way, using the procedures for solving them, so that it allows the consolidation of attitudes such as industriousness, responsibility and science. The system of knowledge worked on and treated didactically in this book is related to the algebraic equations and within them the linear, quadratic, fractional and radical equations, the modular equations and the transcendental equations such as, the exponential, logarithmic and trigonometric equations, providing the minimum theoretical and methodological resources, necessary to learn and to successfully face the exercises and problems proposed in each chapter.

On conjectures of Koike and Somos for modular identities for the Rogers–Ramanujan functions

In this paper, we prove modular identities conjectured by Koike and Somos for the Rogers–Ramanujan functions. Our methods focus on approaches that Ramanujan could have employed, including the theory of modular equations, dissections of identities, and methods derived from the approaches of Watson and Rogers.

A Unified Method for Private Exponent Attacks on RSA Using Lattices

Let [Formula: see text] be an RSA public key with private exponent [Formula: see text] where [Formula: see text] and [Formula: see text] are large primes of the same bit size. At Eurocrypt 96, Coppersmith presented a polynomial-time algorithm for finding small roots of univariate modular equations based on lattice reduction and then succussed to factorize the RSA modulus. Since then, a series of attacks on the key equation [Formula: see text] of RSA have been presented. In this paper, we show that many of such attacks can be unified in a single attack using a new notion called Coppersmith’s interval. We determine a Coppersmith’s interval for a given RSA public key [Formula: see text] The interval is valid for any variant of RSA, such as Multi-Prime RSA, that uses the key equation. Then we show that RSA is insecure if [Formula: see text] provided that we have approximation [Formula: see text] of [Formula: see text] with [Formula: see text] [Formula: see text] The attack is an extension of Coppersmith’s result.

Ramanujan’s function k(τ)=r(τ)r 2(2τ) and its modularity

We study the modularity of Ramanujan’s function k ( τ ) = r ( τ ) r 2 ( 2 τ ) k(\tau )=r(\tau ){r}^{2}(2\tau ) , where r ( τ ) r(\tau ) is the Rogers-Ramanujan continued fraction. We first find the modular equation of k ( τ ) k(\tau ) of “an” level, and we obtain some symmetry relations and some congruence relations which are satisfied by the modular equations; these relations are quite useful for reduction of the computation cost for finding the modular equations. We also show that for some τ \tau in an imaginary quadratic field, the value k ( τ ) k(\tau ) generates the ray class field over an imaginary quadratic field modulo 10; this is because the function k is a generator of the field of the modular function on Γ 1 ( 10 ) {{\mathrm{\Gamma}}}_{1}(10) . Furthermore, we suggest a rather optimal way of evaluating the singular values of k ( τ ) k(\tau ) using the modular equations in the following two ways: one is that if j ( τ ) j(\tau ) is the elliptic modular function, then one can explicitly evaluate the value k ( τ ) k(\tau ) , and the other is that once the value k ( τ ) k(\tau ) is given, we can obtain the value k ( r τ ) k(r\tau ) for any positive rational number r immediately.