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: ( Back to comment list | You must be logged in to post comments.)
Confusing problem | Comment 2 of 5 |
This is a confusing problem for the following reasons.

1. It repeats twice in the problem. The first time, it uses ^ for powers. The second time, it uses superscripts.

2. It says, "For any two integers n and m, the number p^(3m+1)+q^(2m+1) is divisible by 3." However, the number n does not appear in p^(3m+1)+q^(2m+1).

3. It is wrong. For example, take p=5, q=13, m=1. q-p=8=2^3, but p^(3m+1)+q^(2m+1)=5^4+13^3=625+2197=2822 is not divisible by 3.


  Posted by Math Man on 2012-12-02 13:46:37
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 (4)
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