# 1997 AHSME Problems/Problem 28

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

## Problem

How many ordered triples of integers $(a,b,c)$ satisfy $|a+b|+c = 19$ and $ab+|c| = 97$? $\textbf{(A)}\ 0\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 12$

## Solution

WLOG, let $a \ge 0$, and let $a \ge b$. We can say this because if we have one solution $(a,b) = (a_0, b_0)$ with $a_0 \ge 0$ and $a_0 > b_0$, we really have the four solutions $(a_0, b_0), (-a_0, -b_0), (b_0, a_0), (-b_0, -a_0)$ by the symmetry of the original problem.

Furthermore, we assert that these four solutions are distinct. We can say that $a > b$, since if $a=b$, we have $c = 19 - 2a$ for the first equation and either $c = 97 - a^2$ or $c = a^2 - 97$ for the second equation. Equating $19 - 2a = 97 - a^2$ gives no integer solution, while equating $19 - 2a = a^2 - 97$ also gives no integer solution.

Thus, we can now assume WLOG that $a \ge 0$ and $a > b$, and each pair of $(a_0,b_0)$ that we get will generate four unique solutions: $(a_0, b_0), (b_0, a_0), (-a_0, -b_0), (-b_0, -a_0)$.

We now divide the problem into $c \ge 0$ and $c < 0$:

If $c \ge 0$, we have $|a + b| + c = 19$ and $ab + c = 97$.

Solving both equations for $c$ and equating them, we get that $ab - |a + b| = 78$. Splitting these up, we find that either $ab - a - b = 78$ or $ab + a+ b = 78$. Factoring both with SFFT gives $(a-1)(b-1) = 79$ or $(a +1)(b+1) = 79$. We factor with the restrctions that $a \ge 0$ and $a > b$. Since $79$ is prime, we have: $a - 1 = 79$ and $b - 1 = 1$, which leads to $(80,2)$. $a + 1 = 79$ and $b + 1 = 1$, which leads to $(78, 0)$.

Each of those solutions could generate $3$ more solutions, giving a total of $8$ potential solutions. However, in each the first set of four solutions, we have $|a + b| = 82$, which from the original first equation $|a + b| + c = 19$ gives $c = 19 - 82$, which contradicts our initial assumption that $c\ge 0$. Similarly, for the second set of four solutions, we have $|a + b| = 78$, which leads to $c = 19 - 78$, also contradicting $c \ge 0$.

If $c < 0$, we have $|a + b| + c = 19$ and $ab - c = 97$. We note that $19 - c$ must be positive whenever $c$ is negative, and thus $|a + b| = a + b$.

Solving both equations for $c$ and using SFFT as above gives $(a+1)(b+1) = 117$. Since $117 = 3^2\cdot 13$, we factor with the restriction that $a\ge 0$ and $a > b$. Thus, we can let $a+1 \in \{117, 39, 13\}$, which means $a \in \{116, 38, 12\}$. These give corresponding $b+1\in \{1, 3, 9\}$, which leads to corresponding $b \in \{0, 2, 8\}$. Combining the solutions, we have $(a,b) = (116, 0), (38, 2), (12, 8)$.

Each of these three solutions permutes, negates, and permute-negates into $4$ solutions as described in the start of the solution, for a total of $12$ solutions.

Checking our solutions to ensure $c < 0$, we find in the first set of four solutions, $|a + b| = 116$, and thus $c = 19 - 116$, which is indeed negative.

In the second set of four solutions, $|a + b| = 40$, which leads to $c = 19 - 40$, which is also negative.

Finally, in the third set of four solutoins, $|a + b| = 20$, which leads to $c = 19 - 20$, which is negative.

Thus, there are $12$ ordered triples, and the answer is $\boxed{E}$.

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.
{"ft_lang_label":"__label__en","ft_lang_prob":0.9339894,"math_prob":1.0000074,"size":2468,"snap":"2023-14-2023-23","text_gpt3_token_len":609,"char_repetition_ratio":0.17451298,"word_repetition_ratio":0.07692308,"special_character_ratio":0.27147487,"punctuation_ratio":0.16260162,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000067,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156],"im_url_duplicate_count":[null,null,null,8,null,8,null,8,null,null,null,null,null,8,null,8,null,8,null,8,null,null,null,null,null,8,null,8,null,8,null,8,null,8,null,null,null,null,null,8,null,8,null,null,null,null,null,null,null,null,null,8,null,null,null,8,null,8,null,8,null,8,null,8,null,null,null,null,null,null,null,8,null,8,null,8,null,8,null,8,null,8,null,null,null,null,null,8,null,null,null,8,null,null,null,8,null,8,null,null,null,null,null,null,null,8,null,8,null,null,null,8,null,null,null,8,null,2,null,null,null,null,null,8,null,8,null,8,null,8,null,8,null,null,null,null,null,null,null,8,null,8,null,8,null,8,null,8,null,8,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-02T01:35:24Z\",\"WARC-Record-ID\":\"<urn:uuid:eeaa2300-946b-4ac9-8fd5-157ea4d37b06>\",\"Content-Length\":\"53879\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3821de3d-35d4-4d21-9cb6-29561c2aeffd>\",\"WARC-Concurrent-To\":\"<urn:uuid:f956cc3f-870e-4f92-aa8a-1b9fc5e34c5a>\",\"WARC-IP-Address\":\"104.26.10.229\",\"WARC-Target-URI\":\"https://artofproblemsolving.com/wiki/index.php?title=1997_AHSME_Problems/Problem_28&oldid=159171\",\"WARC-Payload-Digest\":\"sha1:OG4ZVYCHLJ4KC6355G66I7PFLOGBLHES\",\"WARC-Block-Digest\":\"sha1:R72LPQMSNVYCZBEEOV6W25SYA4TQNGNT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224648245.63_warc_CC-MAIN-20230602003804-20230602033804-00344.warc.gz\"}"}