BasilMarket

Sad Mask
Would you be so kind as to disable your ad-blocker on BasilMarket please? Your support is greatly appreciated.

math help please explain

Chat Forum Talk about topics not related to MapleStory

oAZNvTOFUo Level 31 Renegades Demon Slayer 2
Let x and y be two-digit integers such that y is obtained by reversing the digits of x. The integers x and y satisfy x^2-y^2 = m^2 for some positive integer m.
What is x+y+m?

Answer, and please explain to me how you got it... thank you!
Posted: November 2012 Permalink

Replies

DayServant Level 196 Khaini Shadower
I'll give you a hint, x or y are factors of 9, oh and x will be higher than y.
Nov 18 2012
Spextrums Level 136 Zenith Dark Knight
91 and 18? @DayServant sorry if I ruined the secret
Nov 18 2012
oAZNvTOFUo Level 31 Renegades Demon Slayer 2
91 and 18? @DayServant sorry if I ruined the secret[/quote]

it can also be 27 and 72...
Nov 18 2012
Spextrums Level 136 Zenith Dark Knight
I honestly didn't think of that, my excuse is that it's almost 4am
Nov 18 2012
DayServant Level 196 Khaini Shadower
I'm not sure as to what exactly you are trying to find.

Btw I'll have to redo the calculations.
Nov 18 2012
Spextrums Level 136 Zenith Dark Knight
Hold up, aren't we suppose to take 18^2 from 81^2? or did I read this wrong?
Nov 18 2012
DayServant Level 196 Khaini Shadower
x=11, y=11

11^2 - 11^2 = 0

0^2 = 0

11+11+0=22

[lol. but seriously you haven't given me enough information.]
Nov 18 2012
WiziLiCe Level 175 Bera Blade Master
after about 30 mins... finished a program that gets the answer by the use of bruteforce (trial and error), nevertheless it outputs the answer. I'm sure there's a way with limits to find the answer..
[url=http://img338.imageshack.us/img338/4707/32851302.png]answer (imageshack)[/url]

#include <iostream>
#include <math.h>
using namespace std;
int main(){
int iNum1 =2, iNum2=1;
int iResult1, iResult2;
int iSqrt1, iSqrt2;
double dAns;
int aNum1[2];
int aNum2[2];
for(int c=0;c<=101;c++)
{
//cout <<"iNum2 = "<< iNum2;
//cout <<"tiNum1 = "<< iNum1 << endl;
if(iNum2==10)
{
iNum1++;
iNum2=0;
}
iResult1 = 0;
iResult2 = 0;
int aNum1[2]={iNum1,iNum2};
int aNum2[2]={iNum2,iNum1};
//concatenates the 2 digit number
iResult1 = ((aNum1[0])*10)+aNum1[1];
//cout << "iResult1= " << iResult1 << endl;
iResult2 = ((aNum2[0])*10)+aNum2[1];
// cout << "iResult2= " << iResult2 << endl;

if((iResult1 <= iResult2))
{
cout << "empty setn";
iNum2++;
}
else if(iResult2 <= 10)
{
cout << "empty setn";
iNum2++;
}else
{
iSqrt1 = (iResult1) * (iResult1);
iSqrt2 = (iResult2) * (iResult2);
dAns = iSqrt1 - iSqrt2;
cout << iResult1<< " - " <<iResult2<<" = " << sqrt(dAns) << endl;
iNum2++;
}
}
return 0;
}
[/quote]

btw the answer is 154... (65+56+33)
Nov 18 2012

Become a member

Signup or login to join the conversation.