Brilliant

Practice

Algebra
Geometry
Number Theory
Calculus
Discrete Mathematics
Basic Mathematics
Logic
Classical Mechanics
Electricity and Magnetism
Computer Science
Quantitative Finance
Chemistry

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, interactive explorations.

Used and loved by over 7 million people

Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.

Log in with Facebook Log in with Google

or

Log in with email

Join using Facebook Join using Google

or

Join using email

New user? Sign up

Existing user? Log in

Fibonacci Time

Discrete Mathematics Level 2

In the Fibonacci sequence, $F_{0}=1$ , ${F_1}=1$ , and for all $N>1$ , $F_N=F_{N-1}+F_{N-2}$ .

How many of the first 2014 Fibonacci terms end in 0?

View solutions

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, interactive explorations.

Used and loved by over 7 million people

Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.

Your answer seems reasonable. Find out if you're right!

Sign up to access problem solutions.

That seems reasonable. Find out if you're right!

Log in with Facebook Log in with Google

or

Log in with email

Join using Facebook Join using Google

or

Join using email

New user? Sign up

Existing user? Log in

by Sam Thompson

×

Problem Loading...

Note Loading...

Set Loading...