This is a fibonnaci sequence generator, the colon causes a syntax error
#set variables
num_1 = 1
num_2 = 2
count = 0
terms = int(input("How many terms of the fibonnaci sequence would you
like?")
#function
while terms != count :
num_3 =num_1+num_2
print (num_3)
num_1=num_2
On 29/12/15 16:52, Nathan Clark wrote:
> This is a fibonnaci sequence generator, the colon causes a syntax error
Please always post the full error text.
It contains much useful information.
> terms = int(input("How many terms of the fibonnaci sequence would you
> like?")
Count the
On Tue, Dec 29, 2015 at 11:52 AM, Nathan Clark <26110...@gmail.com> wrote:
> This is a fibonnaci sequence generator, the colon causes a syntax error
>
>
> #set variables
> num_1 = 1
> num_2 = 2
> count = 0
> terms = int(input("How many terms of the fibonnaci sequence would you
> like?")
>
>
>
On Wed, Dec 30, 2015 at 12:00:02AM +0700, Satya Luzy wrote:
> Hello,
> I am currently working on a program to find the prime factor of n, in which
> n is a big integer. Using the Continued Fraction factorization method (I
> will provide the source code below, please don't mind the variables).
Hello there Satya,
>I am currently working on a program to find the prime factor of n, in which
>n is a big integer. Using the Continued Fraction factorization method (I
>will provide the source code below, please don't mind the variables).
I do not know the Continued Fraction factorization
Hi, the problem is in the line that says:
terms = int(input("How many terms of the fibonnaci sequence would you
like?")
is missing a closing ')'
take a look:
terms = int(input("How many terms of the fibonnaci sequence would you
like?"))
Hope you help.
> To be honest this is probably a bit beyond the scope of the tutor
> list which is aimed at questions about the Python language and
> standard library. However I'll make a few observations (and assume
> your logic is OK since you did test it on some smaller data first)
Just to add to Alan's
On 29/12/15 17:00, Satya Luzy wrote:
> Hello,
> I am currently working on a program to find the prime factor of n, in which
> n is a big integer. Using the Continued Fraction factorization method
To be honest this is probably a bit beyond the scope of the tutor
list which is aimed at questions
Sorry it took so long to respond, just getting back from the holidays. You
all have given me much to think about. I've read all the messages through
once, now I need to go trough them again and try to apply the ideas. I'll
be posting other questions as I run into problems. BTW, Danny, best
Hello,
I am currently working on a program to find the prime factor of n, in which
n is a big integer. Using the Continued Fraction factorization method (I
will provide the source code below, please don't mind the variables). It
works perfectly when factorizing below 10 digits numbers. In my code
On Wed, Dec 30, 2015 at 12:00:02AM +0700, Satya Luzy wrote:
> Hello,
> I am currently working on a program to find the prime factor of n, in which
> n is a big integer. Using the Continued Fraction factorization method (I
> will provide the source code below, please don't mind the variables).
I have two situations that I wish to use Git for: 1) Multi-directory
Python projects and 2) learning Python from various books which
inevitably have suggested exercises to program solutions for.
For (1) I might have multiple projects going simultaneously. Say
something like:
project1/
Hello there boB,
Hey, wait a second! What time zone are you in? You can't have 2016
resolutions already. Not even the New Zealanders are there yet!
>I have two situations that I wish to use Git for: 1) Multi-directory
>Python projects and 2) learning Python from various books which
13 matches
Mail list logo
