A Square Problem

Points: 7

Time limit: 2.0s

Memory limit: 64M

Author:

Problem type

Given $a$ ~a~ and $b$ ~b~, determine whether $a^2-b^2$ ~a^2-b^2~ is prime. You must do this $T$ ~T~ times.

The first line will contain the integer $T$ ~T~ $(1 \le T \le 5)$ ~(1 \le T \le 5)~, the number of cases.

The next $T$ ~T~ lines will each contain two integers, $a, b$ ~a, b~ $(1 \le b < a \le 10^{11})$ ~(1 \le b < a \le 10^{11})~.

For each case, print YES if $a^2-b^2$ ~a^2-b^2~ is prime, and NO otherwise on its own line.

4
6 5
16 13
61690850361 24777622630
34 33

YES
NO
NO
YES

Comments

0

MstrPikachu commented on Nov. 27, 2018, 9:47 p.m.

You don't even need BigInteger to solve it in Java.

1

LCC18_Musmid commented on Nov. 14, 2018, 12:59 a.m.

Side note: Use python or ruby instead.