About
Activity
3K followers
Experience & Education
Publications
-
Quasi-fortunate Numbers
Online Encyclopedia of Integer Sequences
See publicationThe Quasi-fortunate numbers are the Least prime m such that either prime(n)# - m is prime or prime(n)# + m is prime, where p# denotes the product of all primes <= p. This set of numbers is useful to find large prime numbers near primorials, and can be used to create algorithms for public-key cryptography like the ones used in the RSA.
Courses
-
Algorithm Design and Analysis
354
-
Computer Networking
330
-
Discrete Math (Python)
136
-
Intro to Math Research (Algorithmic Number Theory)
370
-
Machine Learning
-
-
Modern Physics
304
-
Object Oriented Programming
128
-
Sets, Logic, and Recursion
135
Projects
-
Caption_it, mobile app
- Present
See projectCaoption_it is the first mobile meme making game where you supply the punchlines for pictures and videos that your friends upload. It was programmed in Swift and the Android SDK, and will soon be available in the AppStore.
-
A Primorial Approach for Generating Primes
-
See projectGenerating primes quickly of a given bit size has important applications in multiple fields. For example, RSA, the first public-key cryptosystem, generates 4000-bit primes to secure your data. There are multiple algorithms that rely on generating a random prime within a given bit length and then testing for primality with a strong pseudo-primality test. Currently, this algorithm is characterized by being inconsistent in the time it takes to compute. My goal was to create a computationally…
Generating primes quickly of a given bit size has important applications in multiple fields. For example, RSA, the first public-key cryptosystem, generates 4000-bit primes to secure your data. There are multiple algorithms that rely on generating a random prime within a given bit length and then testing for primality with a strong pseudo-primality test. Currently, this algorithm is characterized by being inconsistent in the time it takes to compute. My goal was to create a computationally consistent algorithm that could be used to find large prime numbers. The algorithm was found to be 91% faster than the standard method when generating primes up to 730 bits with my Primorial Approach.
Honors & Awards
-
Best Hardware Hack at HackHarvard
Harvard
Built a dog training robot, called train-o, that identifies your pet’s pose using OpenCV and Reinforces behavior by dispensing treats at Harvard's Major League Hacking (MLH) event. This project was also featured as part of DevPosts top 5 worldwide weekly hacks. Read more: https://devpost.com/software/train-o-9n85ez
-
McLean County Outstanding STEM Student
McLean County Chamber of Commerce
First-year computer science and physics double major David “Nico” Lopez '21 brings the fun – and the funds – with a $1,000 “Outstanding College Student” scholarship awarded at the McLean County STEM Gala on Wednesday, April 4.
News Article: https://bit.ly/2qIaiJa
-
Illinois Wesleyan Entrepreneurial Fellowship Grant
-
A five-thousand-dollar grant to develop a Caption_it, the first online competitive meme-making game available on Android and IOS.
Languages
-
Spanish
Native or bilingual proficiency
-
English
Native or bilingual proficiency
Other similar profiles
Explore top content on LinkedIn
Find curated posts and insights for relevant topics all in one place.
View top content