Solved horses-in-pursuing problem with complex analysis

Weijia Wu

doi:10.1117/12.2650550

27 September 2022 Solved horses-in-pursuing problem with complex analysis

Weijia Wu

Proceedings Volume 12345, International Conference on Applied Statistics, Computational Mathematics, and Software Engineering (ASCMSE 2022); 123450D (2022) https://doi.org/10.1117/12.2650550
Event: 2022 International Conference on Applied Statistics, Computational Mathematics, and Software Engineering (ASCMSE 2022), 2022, Qingdao, China

Abstract

This paper introduces a classic puzzle, the horse-in-pursuing problem, that N horses run in a counterclockwise direction to their neighboring houses with the same speed on an N-corners regular pentagon that has a side length of M. The problem will be simplified with a square case, that N=4 first, and then to the case of N-corners regular pentagon. This paper provides the solution using Complex Analysis and compares this solution with the classical solution in calculus, geometry, and mechanics.

Citation Download Citation

Weijia Wu "Solved horses-in-pursuing problem with complex analysis", Proc. SPIE 12345, International Conference on Applied Statistics, Computational Mathematics, and Software Engineering (ASCMSE 2022), 123450D (27 September 2022); https://doi.org/10.1117/12.2650550

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available