mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2014-08-20, 22:34   #1
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

80010 Posts
Wink problem 2.4

Hi Math People,

Here is another problem from Terence Tao's book Solving Mathematical Problems.

Problem 2.4 states -

Find all solutions of 2^n + 7 = x^2,
where n and x are integers.

This one is a little tricky.

Regards,
Matt
MattcAnderson is offline   Reply With Quote
Old 2014-08-20, 22:57   #2
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

36×13 Posts
Default

Only one solution: n=1, x=3. Consider the equation, modulo 8.
Batalov is offline   Reply With Quote
Old 2014-08-21, 03:26   #3
axn
 
axn's Avatar
 
Jun 2003

22×3×421 Posts
Default

n = 1, x = -3 ?
axn is online now   Reply With Quote
Old 2014-08-21, 04:10   #4
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

36·13 Posts
Default

Right, right. |x|=3.
Batalov is offline   Reply With Quote
Old 2014-08-21, 04:40   #5
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

25×52 Posts
Default

That is correct. Batalov and Axn are smart cookies.

Regards,
Matt
MattcAnderson is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
What is the problem here? didgogns Msieve 1 2016-11-15 03:31
problem I have science_man_88 Miscellaneous Math 2 2010-10-10 16:36
Problem with LMH derekg Lone Mersenne Hunters 2 2007-02-26 22:47
51 problem Neves Miscellaneous Math 5 2004-02-10 22:59
51 problem Neves Puzzles 15 2004-02-05 23:11

All times are UTC. The time now is 03:53.


Sat Jul 17 03:53:58 UTC 2021 up 50 days, 1:41, 1 user, load averages: 1.75, 1.87, 1.74

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.