Multiplication

Summary

Multiplication (often denoted by the cross symbol , by the mid-line dot operator , by juxtaposition, or, on computers, by an asterisk ) is one of the four elementary mathematical operations of arithmetic, with the other ones being addition, subtraction, and division. The result of a multiplication operation is called a product. The multiplication of whole numbers may be thought of as repeated addition; that is, the multiplication of two numbers is equivalent to adding as many copies of one of them, the multiplicand, as the quantity of the other one, the multiplier; both numbers can be referred to as factors. :a\times b = \underbrace{b + \cdots + b}_{a \text{ times}} For example, 4 multiplied by 3, often written as 3 \times 4 and spoken as "3 times 4", can be calculated by adding 3 copies of 4 together: :3 \times 4 = 4 + 4 + 4 = 12 Here, 3 (the multiplier) and 4 (the multiplicand) are the factors, and 12 is the product. One of the main

Official source

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Related people

Related units

Related concepts

Related courses

Related lectures

Generalized Virasoro algebra: left-symmetry and related algebraic and hydrodynamic properties

Tudor Ratiu

Motivated by the work of Kupershmidt (J. Nonlin. Math. Phys. 6 (1998), 222 -245) we discuss the occurrence of left symmetry in a generalized Virasoro algebra. The multiplication rule is defined, which is necessary and sufficient for this algebra to be quasi-associative. Its link to geometry and nonlinear systems of hydrodynamic type is also recalled. Further, the criteria of skew-symmetry, derivation and Jacobi identity making this algebra into a Lie algebra are derived. The coboundary operators are defined and discussed. We deduce the hereditary operator and its generalization to the corresponding 3 ary bracket. Further, we derive the so-called rho compatibility equation and perform a phase-space extension. Finally, concrete relevant particular cases are investigated.

Taylor & Francis Ltd2016

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest of which remains the Pollard rho algorithm with

r

-adding walks. For the first time, we rigorously analyze the Pollard rho method with

r

-adding walks and prove a complexity bound that differs from the birthday bound observed in practice by a relatively small factor. There exist a multitude of open questions in genus

2

cryptography. In this case, the DLP is defined in large prime order subgroups of rational points that are situated on the Jacobian of a genus~

2

curve defined over a large characteristic finite field. We focus on one main topic, namely we present a new efficient algorithm for computing cyclic isogenies between Jacobians. Comparing to previous work that computes non cyclic isogenies in genus~

2

, we need to restrict to certain cases of polarized abelian varieties with specific complex multiplication and real multiplication. The algorithm has multiple applications related to the structure of the isogeny graph in genus~

2

, including random self-reducibility of DLP. It helps support the widespread intuition of choosing \emph{any} curve in a class of curves that satisfy certain public and well studied security parameters. Another topic of interest is generating hyperelliptic curves for cryptographic applications via the CM method that is based on the numerical estimation of the rational Igusa class polynomials. A recent development relates the denominators of the Igusa class polynomials to counting ideal classes in non maximal real quadratic orders whose norm is not prime to the conductor. Besides counting, our new algorithm provides precise representations of such ideal classes for all real quadratic fields and is part of an implementation in Magma of the recent theoretic work in the literature on the topic of denominators.

EPFL2016

The Autonomous Photovoltaic MarXbot

Francesco Mondada, Philippe Rétornaz, Florian Christopher Vaussard

Domestic service robots are currently powered by the mains electricity. The growing multiplication of such devices negatively impacts our environment. In this study, we show the feasibility of harvesting energy from natural light in an indoor environment. The design of the harvester is carefully carried out using an experimental characterisation of several solar panels, while the boost converter is optimised to operate at low-light intensities and the robot is enhanced for low-power operations. The resulting harvester is then thoroughly characterised. Finally, a phototaxis experiment is conducted, proving the feasibility of recharging the robot solely by using this form of energy. The possibility of embedding energy harvesting in indoor mobile robots radically changes the potential impact of this technology in our society.

Springer Berlin Heidelberg2013

r

-adding walks. For the first time, we rigorously analyze the Pollard rho method with

r

-adding walks and prove a complexity bound that differs from the birthday bound observed in practice by a relatively small factor. There exist a multitude of open questions in genus

2

cryptography. In this case, the DLP is defined in large prime order subgroups of rational points that are situated on the Jacobian of a genus~

2

2

2

EPFL2016