Jump to content

Wikipedia:Reference desk/Archives/Mathematics/2006 November 7

From Wikipedia, the free encyclopedia
Mathematics desk
< November 6 << Oct | November | Dec >> November 8 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


November 7[edit]

algebra 2 word problem[edit]

the sum of two digits is nine. 12 times the ten digit equals the number. —The preceding unsigned comment was added by 68.37.97.86 (talkcontribs) .

Assuming the number has two digits (this is important), try representing the tens digit as x and the ones digit as y, and the number as n. Thus 10x+y=n. First, why is the equation I wrote correct? (Try it with some numbers if it is not clear). Next, can you represent the two statements you made with algebraic equations similar to the one I wrote? Try solving those equations for n. Best wishes, --TeaDrinker 01:02, 7 November 2006 (UTC)[reply]
Why not use better symbols, like T for Tens and S for Singles ? (I wouldn't use O for Ones, since it looks like a zero). StuRat 05:56, 7 November 2006 (UTC)[reply]
Surely we are meant to assume a two digit number. The first statement implies the number is a multiple of 9. The second statement implies it is also a multiple of 4. This leaves only two possible candidates for the number, only one of which works. The suggestion of TeaDrinker is a more algebraic way of thinking, and so is likely what the problem intends. --KSmrqT 03:27, 7 November 2006 (UTC)[reply]
To eliminate the other candidate, note that the two conditions imply that the ten digit must be divisible by 3.--gwaihir 09:49, 7 November 2006 (UTC)[reply]

Drag coefficient[edit]

This is more of a physics question, but since it pertains to formulas, I will list it here. How can the drag coefficient be found for objects? The drag coefficient page only lists values for for certain objects, and the formula at the top doesn't seem to help. Thanks. (Note: If this is in the wrong place, please move it.) PullToOpen talk 04:28, 7 November 2006 (UTC)[reply]

You need to use a wind tunnel, where the amount of drag is measured precisely relative to the wind speed, size, and shape of the object. You might also try a Google search, as the particular material you're interested in may already have a known value. StuRat 05:49, 7 November 2006 (UTC)[reply]

top X random, with weights[edit]

How can I get a list of X random entries out of a larger total, where each entry in the list has a different weight?

Eg: ad banners. I have space for 5 ads, but have sold 20. Each ad is given a weight, and I'd like the total number of views for each ad to match their weight.

My first idea was: randomly pick 1 entry from the list, using the weights. Remove that entry from the list, then pick the next one, using the new weights in the now shorter list.

But I'm concerned that this is not actually correct - because now the weights in the shorter list don't take into account the weight from the removed entry. Ariel. 05:19, 7 November 2006 (UTC)[reply]


Most random number generators return a number between 0 and 1. So, add all the weights up, and divide each weight by that number to get the "unitized weights". Here's an example:
Weight A =  2
Weight B =  1
Weight C =  5
Weight D =  2
           --
Total    = 10
Unitized Weight A =  2/10 = 0.2
Unitized Weight B =  1/10 = 0.1
Unitized Weight C =  5/10 = 0.5
Unitized Weight D =  2/10 = 0.2
Range A = 0.0 - 0.2
Range B = 0.2 - 0.3
Range C = 0.3 - 0.8
Range D = 0.8 - 1.0

StuRat 05:46, 7 November 2006 (UTC)[reply]
Thanks for answering, but that's for getting a single random entry - what if I want to pick 2 of them out of your list of 4? But, which 2 I pick is random, but weighted. Ariel. 06:08, 7 November 2006 (UTC)[reply]
I don't see the problem. Use the random number generator once, if it gives you 0.753, then run ad C. Then use the random number generator again, if it gives you 0.332, then run ad C again. It will eventually work out very close to the desired weight for each ad. Are you saying you need it to work out EXACTLY even over some period ? If so, then readjust the weighting each time. StuRat 22:58, 7 November 2006 (UTC)[reply]
Don't forget to add the restriction that the same ad cannot be show simultaneous on different ad spots. 211.28.178.86 10:05, 7 November 2006 (UTC)[reply]
I'm not sure I understand the problem. Are you repeatedly presenting N = 5 out of 20 ads, so that in the long run adi is presented proportionally often to given weight wi? Assuming the weights have been normalized to sum to 1, that means adi is presented on the average N·wi times per round, or, in a total of R rounds, R·N·wi times. You could call this the due number. A possible approach is to keep track of the difference between the due number and the actual number of presentations, and to select those with the largest deficit first. Here is an algorithm in pseudocode:
  • Initialize the deficit di := 0.5 for all ads (a somewhat arbitrary choice);
  • Repeat, for each round:
  • Increment di := di + N·wi for i ranging over all ad numbers;
  • Set the ad selection for this round to empty;
  • For s = 1, ..., N:
  • Find the value of i maximizing di (in case of a tie, pick any);
  • Add adi to this round's selection;
  • Decrement di := di − 1.
This can lead to an ad being selected more than once in a round, but only if N·wi > 1. In that case, not showing it more than once every now and then leads to an ever-increasing deficit.  --LambiamTalk 10:27, 7 November 2006 (UTC)[reply]

Expanding fractional indices[edit]

Is it possible to expand bracketed expressions with fractional indices? How is it done? If not, are there any specific cases where it can be done? --Awesome 09:15, 7 November 2006 (UTC)[reply]

Yes you can, see Binomial theorem, although for non-integer exponents you get an infinite expansion. This is also related to certain aspects of Taylor series. Confusing Manifestation 09:28, 7 November 2006 (UTC)[reply]
Of course, there are also "expansions" like .--gwaihir 09:46, 7 November 2006 (UTC)[reply]
By "index", do you mean exponent?  --LambiamTalk 10:30, 7 November 2006 (UTC)[reply]
That's what I assumed. It's a term sometimes used, especially (IIRC) when first learning about "index rules" (like a^(b+c) = a^b a^c). Confusing Manifestation 10:52, 7 November 2006 (UTC)[reply]

College Algebra[edit]

I am needing help with my homework on quadratic equations and formulas. I cant seem to understand how to do them.I am kind of needing step by step help. If someone can help i would appreciate it very much.

The first step would be to read Quadratic equation and tell us if there is anything there you don't understand, or if you have an exercise which it doesn't help you solve. -- Meni Rosenfeld (talk) 17:27, 7 November 2006 (UTC)[reply]
If you get stuck on a specific problem and need the theory to solve it, you could ask that (as compared to asking for the answer). Again, I'm differentiating that from asking a homework question. Ask a theory question. --AstoVidatu 20:46, 7 November 2006 (UTC)[reply]

Show us what the maths problem is. Show us what you have done so far. Then show us the location where you have got stuck. We shall explain where you went off the track and suggest a way forward for you. 202.168.50.40 20:58, 7 November 2006 (UTC)[reply]

A question related to the polynomial remainder theorem[edit]

If you divide a polynomial by (xa) and get a remainder b, and you divide the same polynomial by (xc) and get a remainder d, what happens when you divide the same polynomial by (xa)(xc)? Is the remainder somehow related to b and d?

Your conditions essentially say that and , and the remainder must be a polynomial of degree at most 1 satisfying these same conditions.--gwaihir 00:39, 8 November 2006 (UTC)[reply]
To spell this out, and assuming ac, the remainder upon division by (xa)(xc) is then:
If you have all integer coefficients, these fractions are also integers.  --LambiamTalk 08:14, 8 November 2006 (UTC)[reply]

A math question[edit]

This is outside of school... Anyway, here it is:

Find all integers k such that k is between -8 and 8 inclusive for which x²+kx+2k+4 is factorable over the integers. For this one, can anyone think of a faster way to do it than just plugging them in and solving? --AstoVidatu 23:39, 7 November 2006 (UTC)[reply]

Hint: first solving, then plugging in?--gwaihir 01:06, 8 November 2006 (UTC)[reply]
The first sentence of the following may be the same hint gwaihir has given. Factorability of this quadratic form requires that its discriminant k²−8k−16 be a square, which is somewhat easier to test. Considerations of modular arithmetic show that k is then of the form 3n+1, and also of one of the two forms 5m and 5m+3. So, taken together, k mod 15 is either 10 or 13. In the given range that leaves only two possibilities, both of which actually give a solution.  --LambiamTalk 09:46, 8 November 2006 (UTC)[reply]

Yeah, I had forgotten about the quadratic equation when I wrote this. That's the piece I was missing. Thanks for the help Lambian. --AstoVidatu 11:48, 8 November 2006 (UTC)[reply]

Just had a thought - dont know why.[edit]

What is the infinith root of infinity?--Light current 23:38, 7 November 2006 (UTC)[reply]

It would be infinity unless I'm missing something. The root of infinity is infinity. And the root of that is infinity. And the root of that is... (I think you get the picture) ;) --AstoVidatu 23:41, 7 November 2006 (UTC)[reply]

The infinitith root of infinity would have to mean
One way to make sense of this question would be to say what if we had some functions g(x) and h(x) which both go to infinity as x increases, and we ask about the behavior of the function defined by
In that case, we could take logarithms and note that
This function, in its limit as x increases, could equal anything from zero to infinity, depending on the relative rates of increase of and . This would make f(x) equal anything from 1 to infinity. So, in a sense, the answer to your question is "anything you want it to be, as long as it's at least 1". -GTBacchus(talk) 00:03, 8 November 2006 (UTC)[reply]
For example,
If I may interject, it's interesting (if technically unrelated) that (or ) occurs for . --Tardis 18:49, 8 November 2006 (UTC)[reply]
but
and
.
Gandalf61 00:32, 8 November 2006 (UTC)[reply]
Nice ones, Gandalf. One more perhaps...
-GTBacchus(talk) 00:42, 8 November 2006 (UTC)[reply]

Thanks to all. My math knowledge is now increased by percent. 8-)--Light current 02:04, 8 November 2006 (UTC)[reply]

This is an example of what is called an indeterminate form.  --LambiamTalk 07:45, 8 November 2006 (UTC)[reply]