Pinned Repositories
bracket-logic
My solution to testing if a math expression has valid bracket logic (example: [(a*b+<7-c>+9] is bad, ([<x+y>+3]-1) is good
Concentric-Rugs
My solution to a python practice problem found on edabit.com
Data-Analytics-Work-Samples
Learning-JWT
Showing My Progress in Learning JSON Web Tokens
Poker-with-Python
Poker with Python
prime_numbers_truncatable
Checks if number is prime and if truncatable left or right.
search-for-the-greatest-z-score
uses numpy.random.randn() to generate a random number from a distribution with a mean of 0 and a standard deviation of 1 (a z-score, basically). It then keeps record on a txt file of the greatest z-score(a z-score with the lowest probability). The greatest z-score I have gotten so far is 6.323802311020854. Can you beat that?
SQL_PortfolioProjects
Jeremiah9000's Repositories
Jeremiah9000/Poker-with-Python
Poker with Python
Jeremiah9000/Concentric-Rugs
My solution to a python practice problem found on edabit.com
Jeremiah9000/prime_numbers_truncatable
Checks if number is prime and if truncatable left or right.
Jeremiah9000/bracket-logic
My solution to testing if a math expression has valid bracket logic (example: [(a*b+<7-c>+9] is bad, ([<x+y>+3]-1) is good
Jeremiah9000/Data-Analytics-Work-Samples
Jeremiah9000/Learning-JWT
Showing My Progress in Learning JSON Web Tokens
Jeremiah9000/search-for-the-greatest-z-score
uses numpy.random.randn() to generate a random number from a distribution with a mean of 0 and a standard deviation of 1 (a z-score, basically). It then keeps record on a txt file of the greatest z-score(a z-score with the lowest probability). The greatest z-score I have gotten so far is 6.323802311020854. Can you beat that?
Jeremiah9000/SQL_PortfolioProjects