Advertisement

The Bent Pin Problem—III: Number Theory Methods

  • Richard R. ZitoEmail author
Chapter

Abstract

Modern aerospace connectors can have hundreds of pins. When the male and female halves of such connectors are joined, a bent pin event can occur that involves multiple pins. Many short circuit paths are possible, and the enumeration of such paths is an essential step in determining the short circuit probability between any two pins. In this chapter, the third about bent pins, the enumeration of “simple” short circuit paths (without loops or switchbacks) between any two pins, and of any length, is described.

References

  1. 1.
    Zito, R. R. (2011, August 8–12). The Curious Bent Pin problem—I: Computer search methods. In 29th International Systems Safety Conference, Las Vegas, NV.Google Scholar
  2. 2.
    Zito, R. R. (2011, August 8–12). The Curious Bent Pin problem—II: Matrix methods. In 29th International Systems Safety Conference, Las Vegas, NV.Google Scholar
  3. 3.
    Campbell, J. (1990). Transformations of myth through time (pp. 164–184). New York: Harper & Row.Google Scholar
  4. 4.
    Adkinson, R. (Ed.). (1995). Sacred symbols (p. 183). New York: Abrams.Google Scholar
  5. 5.
    Ouaknin, M. A. (2010). Mysteres des Chiffres (pp. 289–294). Paris: Assouline.Google Scholar
  6. 6.
    Ross, I. C., & Harary, F. (1952). On the determination of redundancies in sociometric chains. Psychometrika, 17, 195–208.CrossRefGoogle Scholar
  7. 7.
    Parthasarathy, K. R. (1964). Enumeration of paths in digraphs. Psychometrika, 29, 153–1655.MathSciNetCrossRefGoogle Scholar
  8. 8.
    Marshall, C. W. (1971). Applied graph theory (pp. 258–261). New York: Wiley.Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Richard R. Zito Research LLCTucsonUSA

Personalised recommendations