Skip to main content

Italian Folk Multiplication Algorithm Is Indeed Better: It Is More Parallelizable

  • Chapter
  • First Online:
Decision Making under Constraints

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 276))

  • 487 Accesses

Abstract

Traditionally, many ethnic groups had their own versions of arithmetic algorithms. Nowadays, most of these algorithms are studied mostly as pedagogical curiosities, as an interesting way to make arithmetic more exciting to the kids: by applying to their patriotic feelings—if they are studying the algorithms traditionally used by their ethnic group—or simply to their sense of curiosity. Somewhat surprisingly, we show that one of these algorithms—a traditional Italian multiplication algorithm—is actually in some reasonable sense better than the algorithm that we all normally use—namely, it is easier to parallelize.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bunt, L.N.H., Jones, P.S., Bedient, J.D.: The Historical Roots of Elementary Mathematics. Dover, New York (1988)

    MATH  Google Scholar 

  2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge, Massachusetts (2009)

    Google Scholar 

  3. Knuth, D.E.: The Art of Computer Programming, vol. 2. Seminumerical Algorithms, Addison Wesley, Reading, Massachusetts (1969)

    Google Scholar 

  4. Llorente, A.: 3 sencillos métodos para aprender a multiplicar sin calculadora, BBC Mundo, posted Nov 22 (2017). http://www.bbc.com/mundo/noticias-42020116

  5. Vargas, J.I., Kosheleva, O.: Russian peasant multiplication algorithm, RSA cryptosystem, and a new explanation of half-orders of magnitude. J. Uncertain Syst. 1(3), 178–184 (2007)

    Google Scholar 

Download references

Acknowledgements

This work was supported in part by the US National Science Foundation grant HRD-1242122.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vladik Kreinovich .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ceberio, M., Kosheleva, O., Kreinovich, V. (2020). Italian Folk Multiplication Algorithm Is Indeed Better: It Is More Parallelizable. In: Ceberio, M., Kreinovich, V. (eds) Decision Making under Constraints. Studies in Systems, Decision and Control, vol 276. Springer, Cham. https://doi.org/10.1007/978-3-030-40814-5_7

Download citation

Publish with us

Policies and ethics