We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

# Project Euler #225: Tribonacci non-divisors

# Project Euler #225: Tribonacci non-divisors

+ 0 comments Hints:

What is

`'S mod N'`

when N is a divisor of S?Learn that modulo arithmetic means:

`(a + b + c) mod N == (a mod N + b mod N + c mod N) mod N`

Do you need to calculate the full values of large tribonacci numbers?

A non-divisor cannot go on forever without repeating. Can you detect a cycle?

Let me know if these give away too much!

+ 0 comments first of all we need to know till how many terms do we need to check but they didn't mention it naaaa....

+ 0 comments How many terms needs to generate to check for the divisibility? I didn't see it mentioned anywhere. Please help!

+ 2 comments I am getting 11 is th 1st number in this sequence can u suggest y not 11

+ 1 comment Why 7 is the first odd number with this property?

Load more conversations

Sort 24 Discussions, By:

Please Login in order to post a comment