venik

S_{N} = S_{N-2} + S_{N-1}

A = \left[\begin{array}{cc} 0 & 1\\ 1 & 1 \end{array}\right]

A \left[\begin{array}{cc} S_{N-2} \\S_{N-1} \end{array}\right] = 
\left[\begin{array}{cc} 0 & 1\\ 1 & 1 \end{array}\right] \left[\begin{array}{cc} S_{N-2} \\S_{N-1} \end{array}\right] = 
\left[\begin{array}{cc} S_{N-1} \\ S_{N} \end{array}\right]


\left[\begin{array}{cc} 0 & 1\\ 1 & 1 \end{array}\right] \left[\begin{array}{cc} 0 & 1\\ 1 & 1 \end{array}\right] \left[\begin{array}{cc} S_{0} \\S_{1} \end{array}\right] = 

venik

#!/usr/bin/env python
# Sasha Nikiforov

import numpy as np
import numpy.linalg as lg

from functools import reduce

# Not super optimal way to calculate N-th Fibonacci - taken
# from stackoverflow

venik

function getRsaFromPubKey(pubKeyB64: string): RSAKey {
    const pubKeyDecoded = b64tohex(pubKeyB64);

    // jsrsasign cannot build key out of PEM or ASN.1 string, so we have to extract modulus and exponent
    // you can get some idea what happens from the link below (keep in mind that in JS every char is 2 bytes)
    // https://crypto.stackexchange.com/questions/18031/how-to-find-modulus-from-a-rsa-public-key/18034#18034
    const modulus = pubKeyDecoded.substr(50, 128);
    const exp = pubKeyDecoded.substr(182, pubKeyDecoded.length);

    return KEYUTIL.getKey({n: modulus, e: exp});

venik

difference(newObject: any, baseObject: any) {
    function changes(newObject: any, baseObject: any) {
        return _.transform(newObject, function(result, value, key) {
            if (!_.isEqual(value, baseObject[key])) {
                result[key] = (_.isObject(value) && _.isObject(baseObject[key])) ? changes(value, baseObject[key]) : value;
            }
        });
    }

    const rval = changes(newObject, baseObject);

venik

#!/usr/bin/env bash

# Author: Sasha Nikiforov

# source of inspiration
# https://stackoverflow.com/questions/41293077/how-to-compile-tensorflow-with-sse4-2-and-avx-instructions

# Detect platform
if [ "$(uname)" == "Darwin" ]; then
	# MacOS