2, the smallest positive integer x makes 3 ^ x - 2019 divisible by 127,
CodePudding user response:
This is a bit harder...CodePudding user response:
I fry, within the scope of 32 digits without solution ~ ~ ~CodePudding user response:
Say is the firstCodePudding user response:
For x:=100 to 100000 the doThe begin
If x x x - 2019 & lt; 10459 then the Continue;
If (mod (x * x - 2019) 10459)=0 then
The begin
ShowMessage (IntToStr (x));
The Exit;
end;
end;
73062 not right
CodePudding user response:
The second is 31, this is very good, not to say theFirst, 73062 must be wrong, it is estimated that your x is an integer or cardinal, ^ 2=5338055844, 73062 is beyond the scope of 32-bit unsigned number, so you have the calculation of the overflow
This question no. 24 has been calculated, 32 digits unanswered, within the scope of a 64 - bit computing to more than $26000 unanswered, or give up, because of the limitation of three consecutive reply, don't to go back to
The x must be a very large number, 64 digits scope is to say, there is no solution to test the 10459! , 10460! , 10461! . Sure to find (because 10459 is a prime number), but is the smallest integer solutions to say
CodePudding user response:
Yesterday at home again remind of the topic, read a book, card again, there is no solution ~ ~ ~CodePudding user response: