top of page

On the Prime Pairs - Code

This is the accompanying code to the our paper "On the Prime Pairs". Each section pertains to a specific equation or operation. This serves as a way to illustrate the function of each part of the proof.


Link to colab





On the Prime Pairs


By Suqin Ao and Lucy Lu



Abstract


By using a new method with Sieves, we can find all kinds of prime pairs including the twin primes, and prove that for any natural number k, there are infinitely many pairs of primes that differ by 2k. Also, by exploring the density of prime pairs that add together to equal to an even number, we prove that for every even number n >2, there exists at least one pair of primes p and q such that n = p + q.




Download full paper below.


August 31, 2023

PDF

LAL_aom_06
.pdf
Download PDF • 188KB



  • GitHub
  • Discord
  • TikTok
  • White Instagram Icon
  • Youtube
  • X

© 2024 by LUCY

bottom of page