Hints:

1. What is 'S mod N' when N is a divisor of S?

2. Learn that modulo arithmetic means: (a + b + c) mod N == (a mod N + b mod N + c mod N) mod N

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

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

Let me know if these give away too much!

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

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

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

Why 7 is the first odd number with this property?