Loading [MathJax]/extensions/TeX/mathchoice.js
 
+0  
 
0
12
7
avatar+9 

How many integers n with 70n90 can be written as n=ab+2a+3b for at least one ordered pair of positive integers (a,b)?

 

This question really confused me because I don't understand what it's asking. 

 

♥️ Thank you so much for your time and help! ♥️

 Aug 13, 2024
 #1
avatar+1776 
0

Analyzing the Equation and the Range

 

Understanding the Equation:

 

We can factor the equation as follows:

 

n = ab + 2a + 3b

 

n = a(b + 2) + 3b

 

n = a(b + 2) + 3(b + 2) - 6

 

n = (a + 3)(b + 2) - 6

 

Implications of the Equation:

 

This means that n + 6 must be a product of two integers greater than 2.

 

Considering the Range:

 

We're looking for n between 70 and 90, inclusive.

 

So, n + 6 will be between 76 and 96, inclusive.

 

Finding Suitable Pairs

 

We need to find pairs of integers greater than 2 whose product lies between 76 and 96.

 

Lower Bound: The smallest product we can form with integers greater than 2 is 3 * 4 = 12. This is far below 76.

 

Upper Bound: We can start checking larger products.

 

5 * 16 = 80

 

6 * 13 = 78

 

7 * 12 = 84

 

8 * 11 = 88

 

9 * 10 = 90

 

Counting Valid Values of n:

 

For each of the products above, we can find a corresponding n by subtracting 6.

 

Therefore, there are 5 possible values of n between 70 and 90 that can be expressed in the given form.

 

Answer: There are 5 integers n with 70 ≤ n ≤ 90 that can be written as n = ab + 2a + 3b for at least one ordered pair of positive integers (a, b).

 Aug 13, 2024
 #2
avatar+9 
0

Thank you so much for your help, but that didn't work... I'm wondering where you got the 6 from in "n = a(b + 2) + 3(b + 2) - 6", and if that might be the problem? Could it be that you added it to one side, but not the other?

anonymousSingularity  Aug 13, 2024
 #3
avatar+1953 
+1

Here, let me give this problem a shot. 

First, let's try to simplify this problem a bit. We can use Simon's Favorite Factoring Trick. 

Let's factor the right side a bit for n. We get

n=ab+2a+3bn=a(b+2)+3b

 

Now, since we want b to be factored as well, let's add 6 to both sides. This will come in handy later. 

We get

n+6=a(b+2)+3(b+2)n+6=(a+3)(b+2)

 

Now, this problem has transformed for numbers that match the conditions

76(a+3)(b+2)96

 

The only numbers that don;t satsify these conditions are numbers with only two factors and one is less than 3. Thus, we can calculate each number. Here, I did it for you! :)

Thus, since there are a total of 21 numbers and 7 are not valid, we have 21 - 7 = 14 as our final answer. 

 

So 14 should be the answer. I'm not confident on the answer, I might have errored a bit. However, I think it's CLOSE to the right answer. Maybe 12 or 15, but 14 should be right. 

 

Thanks! :)

 Aug 13, 2024
edited by NotThatSmart  Aug 13, 2024
 #5
avatar+1262 
0

To solve for the number of integers n within the interval 70n90 that can be expressed in the form

 

n=ab+2a+3b,

we can rearrange the equation for n:

n=ab+2a+3b=a(b+2)+3b.

Now, we can let m=b+2. Then, we can rewrite b in terms of m as b=m2. Substituting this back into our formula gives:

n=a(m)+3(m2)=am+3m6=(a+3)m6.

Now, we can rearrange this to isolate m:

n+6=(a+3)mm=n+6a+3.

Since m is a positive integer, n+6 must be divisible by a+3. We can explore which integers give permissible m values by determining values of n+6:

- The smallest n is 70, so n+6=76.


- The largest n is 90, so n+6=96.

Consequently, we need to examine the integers from 76 to 96:

76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96.

Next, we can determine the possible values of a+3. Since a is a positive integer, a1 implies a+34.

 

Therefore, m can take any integer value for a+3{4,5,6,}.

To find integers n, we need n+6 to be divisible by each a+3:

- For k=4: n+6=76, gives .

- For : means , giving .

- For : means , yielding .

- For : which gives as .

- For : gives , yielding .

- For : gives , yielding .

Now, we can collect all the possible :

From :


From :


From :


From :


From :


From :

Next, let's find unique from all these lists:

- Compiling unique values from the sets we found: .

Thus, the unique values of between are:



Counting these gives us:



Therefore, the number of integers that can be expressed in the desired form is .

 Aug 13, 2024
 #6
avatar+9 
0

Thank you all for the help! Sadly, both 5 and 14 were wrong, and the right answer was 15 lol. Here's the problem explanation that I got after getting the problem wrong: 

 

We use Simon's Favorite Factoring Trick: observe that , so to obtain another factor of , we need to add . So , and .

Thus we need to find how many integers  with  can be written as  for at least one ordered pair of positive integers .    Any that works must have the property that there exists positive integers and with and . Otherwise, we wouldn't be able to satisfy the condition that  and are positive integers. That is, works because , but  doesn't because the only possible ways to decompose  as a product of two positive integers are  and , and in neither of those cases can both  and  be positive integers.

The rest is a brute force check: we need to eliminate prime numbers, as they definitely don't allow us to have  and  be positive integers, and we need to eliminate numbers of the form , where is prime. Every other number has a pair of factors and  that satisfy and .

We complementary count:  are primes, and  are twice a prime. Our answer is thus the total number of integers  between  and minus , or simply .

 Aug 13, 2024
 #7
avatar+49 
0

it comes from the MathCounts 2022 National Sprint. Question #23.

 Aug 20, 2024

2 Online Users