fabiom

function BirthdayParadox(n)
    # Returns the probability of two people out of n having the same birthday.
    1-prod( ((365-n+1):365.0) /365.0 )
end

fabiom

import random

tab = []
for i in range(9):
	tab.append("-")

jogador = []
computador = []

def imprime():

fabiom

#!/usr/bin/env python3
# Run `import roman` then you can use the function `roman.rnumeral()`.

def rnumeral(n):
	
    if n >= 4000:
        print('The largest number that can be represented in roman numerals is 3999.')
        return
    if n <= 0:
        print('Choose a positive number.')

fabiom

Keybase proof

I hereby claim:

• I am fabiom on github.
• I am fabiom (https://keybase.io/fabiom) on keybase.
• I have a public key whose fingerprint is 45C9 037A 07F7 EF49 1133 9C25 77DE 719D 93EF C14F

To claim this, I am signing this object: