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

Home > Just Math
Divisible by 3. (Posted on 2012-12-02) Difficulty: 2 of 5
Let p and q be two different prime numbers greater than 3.Prove that if their difference is 2^n, then for any two integers n and m,the number S=p^(3m+1)+q^(2m+1) is divisible by 3.

Let p and q be two different prime numbers greater than 3.
Prove that if their difference is 2n, then for any two integers n and m,
the number S = p(3m+1) + q(2m+1) is divisible by 3.

No Solution Yet Submitted by Danish Ahmed Khan    
Rating: 3.0000 (2 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
I think this works:broll2012-12-03 07:14:18
re: Confusing problembroll2012-12-02 23:41:23
re: Confusing problembrianjn2012-12-02 17:21:53
Confusing problemMath Man2012-12-02 13:46:37
Some ThoughtsSome thoughtsbroll2012-12-02 11:23:10
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 (11)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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