Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (anonymous):

Number theory question: Is there a general way of finding all integer n for which \[\frac{\prod_{i=1}^n \left( a_i + b_i n \right)}{c + d n}\] is an integer (a,b,c,d are also integers)? I understand there may be an infinite set of possible n, but is there a way of finding the pattern of the n simply?

OpenStudy (anonymous):

fix your tex I can't read your question

OpenStudy (anonymous):

It works perfectly for me.

OpenStudy (anonymous):

@henpen What are the limits for Pi?

OpenStudy (anonymous):

It's a finite product of terms.

OpenStudy (anonymous):

@genius12 lol

OpenStudy (anonymous):

@Jack175 That's what it looks like and that's what I call it....makes sense no? lol

OpenStudy (anonymous):

@henpen I know what the notation means lol I was asking you for the limits like in the above example it's k = 1 and goes to 5 etc...

OpenStudy (anonymous):

Arbitrary, k=1 to some other integer. take 2 for simplicity if you want for the first solution

OpenStudy (anonymous):

but k has to start at 1 or can it start at any integer? @henpen

OpenStudy (anonymous):

It doesn't matter, call it 1.

OpenStudy (anonymous):

Ok and what is the small subscript 'i' to the left of \(\bf a_i+b_in\)? @henpen

OpenStudy (anonymous):

\[_{i=1}^n\{a_i\}\] is just a set of integers.

OpenStudy (anonymous):

*

OpenStudy (anonymous):

@henpen omg lol, you see there is a small subscript 'i' out side the numerator bracket in the corner near the Pi? What is that there for is what I'm asking rofl...

OpenStudy (anonymous):

It's multiplying over all i in the set {1,...,n}.

OpenStudy (anonymous):

It's shorthand for \[\prod_{i=1}^n\]

OpenStudy (anonymous):

Are we to assume that the g.c.d (a,b,c,d) = 1?

OpenStudy (anonymous):

@henpen I got a solution if you're still here. Also verify any conditions/restrictions that this question poses before I post the solution.

OpenStudy (anonymous):

I'm here, and @domu no.

OpenStudy (anonymous):

@genius12 ?

OpenStudy (anonymous):

@henpen hold on a sec. answering a question.

OpenStudy (anonymous):

@henpen K I am back. You there?

OpenStudy (anonymous):

Yes

OpenStudy (anonymous):

Ok I am going to make two assumptions here. Firstly, both {a} and {b} is the set all integers and that the i'th term in each set is the same hence \(\bf a_i=b_i\) You ok with that? @henpen

OpenStudy (anonymous):

No

OpenStudy (anonymous):

I'll give an example.

OpenStudy (anonymous):

Find all n such that \[\frac{(2n+3)(2n+25)}{5n+56}\] is an integer

OpenStudy (anonymous):

@henpen What does your solution look like to the problem you just posted?

OpenStudy (anonymous):

It looks like an infinite set of possible n. I'm asking whether there's a way of generating that set without trying each one out.

OpenStudy (anonymous):

Are the initial set of integers {a_i}, {b_i}, c, and d fixed or are we trying to find such a set for which the product will be an integer? Also, are each of the integers strictly positive?

OpenStudy (anonymous):

I would like to know that as well. Are sets of {a} and {b} fixed or not. If they are not fixed then I don't know how one would solve this question. @henpen @domu

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!