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.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #225: Tribonacci non-divisors
  4. Discussions

Project Euler #225: Tribonacci non-divisors

Problem
Submissions
Leaderboard
Discussions

Sort 24 Discussions, By:

votes

Please Login in order to post a comment

  • ebolinger
    2 years ago+ 0 comments

    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!

    1|
    Permalink
  • pandu_varshith
    3 years ago+ 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|
    Permalink
  • trade_danish
    3 years ago+ 0 comments

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

    0|
    Permalink
  • jatlasanthosh801
    3 years ago+ 2 comments

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

    0|
    Permalink
  • japananh
    3 years ago+ 1 comment

    Why 7 is the first odd number with this property?

    0|
    Permalink
Load more conversations

Need Help?


View top submissions
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature