About me
Hey! I'm Jerry! I'm just someone who codes and programs for fun. I like to read, play chess, and basketball. I am a programmer at Team 334 (FRC).
🎹 Currently Learning How To Play The Piano
😄 Pronouns: He/Him
Timeline
Team 334 2024 Robot
Ascent, Our robot for the 2024 season competing in the 2024 season, excelled at scoring and climbing. We were rank #25 in 2024 NYC Regionals.
2025
Team 334 2025 Robot
A robot for the 2025 season competing in the FIRST Robotics Competition 2025 Reefscape, designed to score all levels in the game. We were rank #12 with a record of 7-4-0, and winning the 2025 NYC Regional Judges Award. I helped program one of the robot's subsystem: serializer. Serializer is responsible for allowing for a smooth pass off to our end effector.
2025
Art Gallery Simulation
A visualization of the Art Gallery Problem, a classic problem in graph theory. The simulation allows the user to place points which are paintings in an art gallery and calculates the minimum number of guards needed to watch over all the paintings. It also provides a visual representation of the guards' coverage areas.
2025
Sum of Arrangements from 1 to 2005 with Steps 2 or 3
This paper investigates the number of valid arrangements from 1 to 2005 where consecutive terms differ by 2 or 3, as well as the sum of all such arrangements. By modeling the problem as a graph and testing small cases, a recurrence relation was discovered:
f(n) = f(n − 2) + f(n − 3)
This recurrence counts the number of valid paths. Extending this idea, a recurrence for the sum was derived:
S(n) = S(n − 1) + S(n − 2) − S(n − 4)
This allows efficient computation of large values. The investigation shows how simple constraints can lead to complex exponential growth. This combines ideas from graph theory and combinatorics while opening directions for further exploration. To further compute larger values, I implemented a BFS algorithm to compute the number of arrangements and their sum from 1 to n.
Get in Touch
Feel free to reach out to me through email