Skip to content

Instantly share code, notes, and snippets.

def remove_param_from_uri(uri, param):
if override_link_type:
o = urlparse(uri)
query = {x.split('=')[0]: x.split('=')[1] for x in o.query.split('&')}
_is_lt = False
for x in query:
if x.lower() == param:
_is_lt = True
break
if _is_lt:
@alex-polosky
alex-polosky / twin_prime_digital_root_8.py
Created March 28, 2022 02:18
Twin primes multiplication digital root equals 8 conjecture via Numberphile
import math
def is_prime(n):
if n in (1, 2):
return True
for x in range(2, math.ceil(n**0.5) + 1):
if n % x == 0:
return False
return True
@alex-polosky
alex-polosky / whatsSpecial.py
Last active March 24, 2019 22:48
What's special about 277777788888899? Generator
def r(n, s=0):
if n < 10:
return n, n, s
s += 1
j = str(n)
k = 1
for l in j:
k *= int(l)
if k > 9:
m = r(k, s)
@alex-polosky
alex-polosky / gen_key_store.py
Created October 5, 2018 04:51
Generating key stores for database
import bcrypt
from cryptography.hazmat.primitives.asymmetric import padding
from cryptography.hazmat.primitives.asymmetric import rsa
from cryptography.hazmat.backends import default_backend
from cryptography.hazmat.primitives import hashes
from cryptography.hazmat.primitives import serialization
from cryptography.hazmat.primitives.asymmetric import utils
class settings(object):
SECURE_STORE = {
from math import sqrt
def arb(n, A, B):
return ((sqrt(5) + 1) / 2) ** n * ((3 * sqrt(5) - 5) * A + (5 - sqrt(5)) * B) / 10
def gen(l, A, B):
return [(n, int(round(arb(n, A, B)))) for n in range(l)]
def pprint(l, A, B):
for each in gen(l, A, B):