Sign up or sign in

Undergraduate Posters

Undergraduate Poster Session #15

Subevent of Undergraduate Poster Session

Phillips Lobby

Eastern Time (US & Canada)

Starts at: 2025-03-01 10:45AM

Ends at: 2025-03-01 12:00PM

Brocard’s Problem Abstract

Egor Maximenko ⟨emaximen@highpoint.edu⟩

Abstract:

While exploring Brocard’s Equation n!+1=m2, which is known to have 3 solutions, st. m,nN, we develop an algorithm to effectively store factorials of large numbers. First, we begin by prime-decomposing the factorial with the help of Legendre’s Formula. Then, we convert the resulting product of prime powers into a sum by taking logarithms of convenient base. Finally, we implement the algorithm to search for potential solutions in N for Brocard’s Equation up to 100000!.

Back to events