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.)
re: Confusing problem | Comment 3 of 5 |
(In reply to Confusing problem by Math Man)

Re Duplication.
At review a few suggested that superscripts be added.  This was done leaving the original intact with the author having a choice to accept either.  Unfortunately this hasn't been done.

As "n" does not appear in the expression, what would be the effect if the first "m" was substituted for "n", or conversely, the second?

As scholars cannot edit this (and it seems neither can Danish) then Danish may ask levik to do the necessary edit.



  Posted by brianjn on 2012-12-02 17:21:53

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