MLX DEMO
codeMLX03.Inferencemicrosoft-phi-cookbook
Export
[1]
[2]
Fetching 13 files: 0%| | 0/13 [00:00<?, ?it/s]
Special tokens have been added in the vocabulary, make sure the associated word embeddings are fine-tuned or trained.
[3]
[4]
==========
Prompt: <|user|>
<|user|>
Write python code for Fibonacci serie. Please use markdown as output<|end|>
<|assistant|><|end|>
<|assistant|>
Certainly! Below is a Python code snippet for generating the Fibonacci series up to a given number of terms. The code is written with readability and efficiency in mind.
```python
def fibonacci_series(n):
"""
Generate a Fibonacci series up to n terms.
Parameters:
n (int): The number of terms in the Fibonacci series to generate.
Returns:
list: A list containing the Fibonacci series up to n terms.
"""
# Initialize the first two terms of the Fibonacci series
fib_series = [0, 1]
# Generate the Fibonacci series up to n terms
for i in range(2, n):
next_term = fib_series[i-1] + fib_series[i-2]
fib_series.append(next_term)
return fib_series[:n]
# Example usage
if __name__ == "__main__":
num_terms = 10 # Number of terms in the Fibonacci series
print(f"Fibonacci series up to {num_terms} terms:")
print(fibonacci_series(num_terms))
```
This code defines a function `fibonacci_series(n)` that generates the Fibonacci series up to `n` terms. The Fibonacci series starts with 0 and 1, and each subsequent number is the sum of the previous two. The function returns a list containing the series up to `n` terms.
The example usage demonstrates how to call the function to generate a Fibonacci series with 10 terms. You can adjust the `num_terms` variable to generate a series with a different number of terms.<|end|>
==========
Prompt: 68.037 tokens-per-sec
Generation: 34.511 tokens-per-sec