def get_proba(self):
for i in range(self.k // 2 + 1):
prod = eulerfun.binomial(self.n, i)
last = self.n - 2 * i + 1
for j in range(last, self.n + 1):
prod *= j
prod = prod / (self.denominateur * 2**i)
self.proba += prod
def main():
start = time.perf_counter()
res = 0
for i in range(0, 432):
res += eulerfun.binomial(1000, i)
print(round((1 - res / 2**1000), 12))
print('temps d\'exécution', time.perf_counter() - start, 'sec')
def main():
start = time.perf_counter()
res = 0
for i in range(0, 432):
res += eulerfun.binomial(1000, i)
print(round((1 - res / 2 ** 1000), 12))
print("temps d execution", time.perf_counter() - start, "sec")
def lucas(n, m, q):
res = 1
n2 = decimal_to_base(n, q)
m2 = decimal_to_base(m, q)
for k in range(len(n2)):
if k > len(m2) - 1:
temp = 0
else:
temp = m2[k]
res = (res * eulerfun.binomial(n2[k], temp)) % q
return res
def lucas(n, m, q):
res = 1
n2 = decimal_to_base(n, q)
m2 = decimal_to_base(m, q)
for k in range(len(n2)):
if k > len(m2) - 1:
temp = 0
else:
temp = m2[k]
res = (res * eulerfun.binomial(n2[k], temp)) % q
return res
