def Fib16_note(N):
"""
15-note per phi Fibonacci scale - lowest note is zero, returns Hz
"""
K = (N//16)+17
B = [int(x) for x in list('{0:0b}'.format(16+N%16))][1:]
return fibonacci(K) + \
B[0]*fibonacci(K-3) + \
B[1]*fibonacci(K-5 + B[0]) + \
B[2]*fibonacci(K-7 + B[0] + B[1]) + \
B[3]*fibonacci(K-9 + B[0] + B[1] + B[2])
def Fib8_note(N):
"""
7-note per phi Fibonacci scale - lowest note is zero, returns Hz
Pattern of intervals effectively repeats from every 8th note, but
generated from integer Hz values, so not exact repetition.
"""
K = (N//8)+9
B = [int(x) for x in list('{0:0b}'.format(8+N%8))][1:]
return fibonacci(K) + \
B[0]*fibonacci(K-3) + \
B[1]*fibonacci(K-5 + B[0]) + \
B[2]*fibonacci(K-7 + B[0] + B[1])
def get_response(self):
header = self.__request_header
num = self.get_query_string("i")
context = ""
if num.isdigit():
if int(num) == 0:
str_arr = 'No list for the first 0'
context = "{\"success\":0,\"data\":%d,\"message\":\"the output list is, (%s)\"}" % (
0, str_arr)
else:
fab = fibonacci(int(num) - 1)
len_arr = len(fab)
#str = 'this is test'
str_arr = ','.join(str(i) for i in fab)
context = "{\"success\":0,\"data\":%d,\"message\":\"the first num in the fibonacci is, (%s)\"}" % (
int(len_arr), str_arr)
writeLog('info', str_arr)
writeLog('info', context)
else:
context = "{\"success\":-1,\"data\":%d,\"message\":\"input error, (%s)\"}" % (
-1, num)
#response = "%s %d\n\n%s\n\n" % (header, len(context), context)
response = "%s" % (context)
writeLog('info', response)
return response
def test_test1():
params= fibonacci(
n = 6,
)
value_estimated = params
value_computed = 8
assert (value_estimated == value_computed)
def test_fibonacci(self):
f = fibonacci()
self.assertEquals(f.next(), 1)
self.assertEquals(f.next(), 2)
self.assertEquals(f.next(), 3)
self.assertEquals(f.next(), 5)
self.assertEquals(f.next(), 8)
def shootnumber(canopyShootNumber=288.0,
leafNumber=0.0,
sowingDensity=288,
targetFertileShoot=600.0,
tilleringProfile=[288],
leafTillerNumberArray=[1],
tillerNumber=1):
"""
CalculateShootNumber Model
Author: Pierre MARTRE
Reference: Modeling development phase in the
Wheat Simulation Model SiriusQuality.
See documentation at http://www1.clermont.inra.fr/siriusquality/?page_id=427
Institution: INRA/LEPSE Montpellier
Abstract: calculate the shoot number and update the related variables if needed
"""
oldCanopyShootNumber = canopyShootNumber
emergedLeaves = int(max(1, ceil(leafNumber - 1)))
shoots = fibonacci(emergedLeaves)
canopyShootNumber = min(shoots * sowingDensity, targetFertileShoot)
averageShootNumberPerPlant = canopyShootNumber / sowingDensity
if (canopyShootNumber != oldCanopyShootNumber):
tilleringProfile.append(canopyShootNumber - oldCanopyShootNumber)
tillerNumber = len(tilleringProfile)
for i in range(len(leafTillerNumberArray), int(ceil(leafNumber))):
leafTillerNumberArray.append(tillerNumber)
return averageShootNumberPerPlant, canopyShootNumber, leafTillerNumberArray, tilleringProfile, tillerNumber
def test_fibonacci(self):
self.assertEqual(0, fibonacci(0))
self.assertEqual(1, fibonacci(1))
self.assertEqual(1, fibonacci(2))
self.assertEqual(2, fibonacci(3))
self.assertEqual(3, fibonacci(4))
self.assertEqual(5, fibonacci(5))
def test_fibonacci_2(self):
self.assertEqual([0,1,1], fibonacci(2))
def test_fibonacci_3(self):
self.assertEqual([0,1,1,2],fibonacci(3))
def testFib(self):
self.assertEqual(fibonacci(31), 1346269)
def test_fibonacci_1(self):
self.assertEqual([0,1], fibonacci(1))
len(vetor) - 1, busca)))
print("")
nFatorial = 5
print("Fatorial de {} = {}".format(nFatorial, fatorial(nFatorial)))
print("")
xPotencia = 4
nPotencia = 5
print("{} º potencia(v1) de {} = {}".format(nPotencia, xPotencia,
potenciaV1(xPotencia, nPotencia)))
print("")
print("{} º potencia(v2) de {} = {}".format(nPotencia, xPotencia,
potenciaV2(xPotencia, nPotencia)))
print("")
print("{} º potencia(v3) de {} = {}".format(nPotencia, xPotencia,
potenciaV3(xPotencia, nPotencia)))
print("")
print("Busca binaria recursiva indice: {}".format(
buscaBinariaRecursiva(vetor, 0, len(vetor), busca)))
print("")
N = 11
print("Fibonacci recursivo de {} = {}".format(N, fibonacciRecursivo(N)))
print("")
print("Fibonacci de {} = {}".format(N, fibonacci(N)))
def testFib(self):
self.assertEqual(fibonacci(1), 1)
def test_fibonacci_2(self):
self.assertEqual([0, 1, 1], fibonacci(2))
def test_fibonacci_0(self):
#self.assertTrue('./test.txt', parse_path(path, name))
self.assertEqual([0], fibonacci(0))
def test_fibonacci_0(self):
#self.assertTrue('./test.txt', parse_path(path, name))
self.assertEqual([0], fibonacci(0))
def test_fibonacci_1(self):
self.assertEqual([0, 1], fibonacci(1))
def test_fibonacci_Six(self):
self.assertEqual(fibonacci(6), 8)
def test_fibonacci_Cing(self):
self.assertEqual(fibonacci(5), 5)
from itertools import takewhile
from fibonacci import *
print sum(x for x in takewhile(lambda x: x < 4000000, fibonacci())
if x % 2 == 0)
def test_fibonacci_5(self):
self.assertEqual([0,1,1,2,3,5], fibonacci(5))
def test_fibonacci_3(self):
self.assertEqual([0, 1, 1, 2], fibonacci(3))
def test_abnormal_fibonacci(self):
self.assertEqual([0], fibonacci(-1))
def test(i): start = time.time() print fibonacci(i) end = time.time() print i print end-start
from fibonacci import*
num = int(raw_input('How many number do you want to be shown?'))
fibonacci(num)
# ------------ # from fibonacci import fib, fib2 # f = fib2(500) # print(f) # ---------- # from fibonacci import * # fib(500) # print(fib2(500)) # ----------- # import fibonacci as fi # fi.fib(500) # ---------- from fibonacci import fib as fibonacci fibonacci(500) # fib.py # https://docs.python.org/3/tutorial/modules.html # #packages-in-multiple-directories # >> Student (Import Folder)
def ejercicioFibonacci():
actualizarPaginas()
num = fibonacci()
return render_template('ejercicio1.html', titulo="Fibonacci", nombre="Sucesión de Fibonacci", cadena = num, paginas=paginas)
'''
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
Find the sum of all the even-valued terms in the sequence which do not exceed four million.
'''
import fibonacci
if __name__ == '__main__':
f = fibonacci()
candidate = f.next()
sum = 0
while (candidate < 4000000):
if candidate % 2 == 0:
sum += candidate
candidate = f.next()
print sum
def test_abnormal_fibonacci(self):
self.assertEqual([0], fibonacci(-1))
def test_fibo(self):
self.assertEqual(fibonacci(10), [1, 1, 2, 3, 5, 8, 13, 21, 34, 55])
def test_fibonacci_5(self):
self.assertEqual([0, 1, 1, 2, 3, 5], fibonacci(5))
from itertools import takewhile from fibonacci import * print sum(x for x in takewhile(lambda x: x < 4000000, fibonacci()) if x % 2 == 0)
