What is the sum of the 2 smallest possible values of n ∈ Z , such that both 2 n + 1 and 3 n + 1 are perfect squares?
Bonus Find the GCD of all such n .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
2 n + 1 is a square so it is odd square.
Now list of odd squares are 1 , 9 , 2 5 , 4 9 , 8 1 , … , from this list both 1 ( 1 = 2 × 0 + 1 , 3 × 0 + 1 = 1 2 ) , 8 1 ( 8 1 = 2 × 4 0 + 1 ) , ( 3 × 4 0 + 1 = 1 2 1 = 1 1 2 ) satisfy the condition so sum is 0 + 4 0 = 4 0 .
Can you copy the L A T E X off my comment , it'll look better this way ? Also, I didn't mean to be rude if you feel that way , I just wanted your solution to look good . ⌣ ¨ . Please check if I made any error and tell me .
Log in to reply
Thanks! Done!
Yes, what about the other values of n and the gcd of all such values?
what if we put 4 and 1
Can anyone please tell me the gcd of n? Gcd(0,40) is 40, but what about the other values of n?
Python:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 |
|
Nice Python script, I think that this equation is also quite well made
Problem Loading...
Note Loading...
Set Loading...
2 n + 1 is a square so it is odd square.
Now list of odd squares are 1 , 9 , 2 5 , 4 9 , 8 1 , … , from this list both 1 ( 1 = 2 × 0 + 1 , 3 × 0 + 1 = 1 2 ) , 8 1 ( 8 1 = 2 × 4 0 + 1 ) , ( 3 × 4 0 + 1 = 1 2 1 = 1 1 2 ) satisfy the condition so sum is 0 + 4 0 = 4 0 .