All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
3 causes 7 (Posted on 2012-03-10) Difficulty: 2 of 5
Show that if a*n^2 + b*n + c (a, b, and c are integers)is divisible by seven for three consecutive integers, then it is divisible by seven for all integers.

See The Solution Submitted by Ady TZIDON    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts A definition | Comment 1 of 2

Tautology; that which is, by definition, tautological.

A more tedious method: there are 3 numbers such that 7 divides (an^2+bn+c), and (a(n+1)^2+b(n+1)+c) , and (a(n+2)^2+b(n+2)+c). We expand the latter two and deduct the common part, (an^2+bn+c), giving: 2ax+a+b, 4ax+4a+2b. Subtracting twice the smaller from the larger gives 2a=7k, so 7 divides a. But if so, then bn+c=7l, bn+b+c=7m, and, again by subtraction, 7 divides b, too. But if so, 7 must also divide c.

Edited on March 11, 2012, 3:23 am
  Posted by broll on 2012-03-11 01:34:26

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information