Results 16 to 30 of 31

- November 13th 2007, 05:08 AM #16

- November 13th 2007, 07:04 AM #17

- Joined
- Nov 2005
- From
- New York City
- Posts
- 10,616
- Thanks
- 10

- November 13th 2007, 04:57 PM #18

- November 14th 2007, 12:11 PM #19
None of the solutions proposed have been that which kids like myself would have been abe to put forward. Are you suggesting that everyone look for simple proofs?

For 1), isn't the probability of picking a real number 0? Do you mean picking it from the natural numbers less than 2008?

Anyway I had a proof, but then my father came in, telling me to get off the computerwhile munching on something, consequently spitting his meal all over me, and allowing me the pleasure of watching the food in his mouth get reduced into a pulp. I am really not in a mood to go through the charades of Latex right now.

- November 14th 2007, 03:29 PM #20
As an example of why I don't think this is as easy as everyone seems to think:

shown for 1-20

Probability of a= any given number, 1/20.

Probablility of b = any given sum of a specific set of factors, 1/20

So each number 1-20 = 1/20 of being picked, then (1/20)*# of potential b's for the a.

(colours and underline are for aesthetic purposes only, intending to improve readibility)

# of potential b's can be found through prime factorization:

__# -> Factors -> potential b's -> probability for b's__

1 -> 1,1 -> 2 -> 1/20

2 -> 1,2 -> 3 -> 1/20

3 -> 1,3 -> 4 -> 1/20

4 -> 1,2,2 -> 5,4 -> 2/20

__5 -> 1,5 -> 6 -> 1/20__

6 -> 1,2,3 -> 7, 5 -> 2/20

7 -> 1,7 -> 8 -> 1/20

8 -> 1,2,2,2 -> 9, 6 -> 2/20

9 -> 1,3,3 -> 10, 6 -> 2/20

__10 -> 1,2,5 -> 11, 7 -> 2/20__

11 -> 1,11 -> 12 -> 1/20

12 -> 1,2,2,3 -> 13, 8, 7 -> 3/20

13 -> 1,13 -> 14 -> 1/20

14 -> 1,2,7 -> 15,9 -> 2/20

__15 -> 1,3,5 -> 16,8 -> 2/20__

16 -> 1,2,2,2,2 -> 17, 10, 8 -> 3/20

17 -> 1,17 -> 18 -> 1/20

18 -> 1,2,3,3 -> 19, 11, 9 -> 3/20

19 -> 1,19 -> 20 -> 1/20

20 -> 1,2,2,5 -> 12, 9 -> 2/20

so the answer is 1/20*(34/20) = .085

So for 1-20, there is an 8.5% chance of choosing an A, B pair where the product equals A and the sum equals B.

(unless I made a mistake, but still this shows the complexity, I think)

So I don't see how you can come up with a simple equation that will be able to take into account that every number will have a different number of potential B's. It seems to me that it would need to be able to find how many factors each number had, including repeats, and how many numbers they could sum to, excluding repeats. And this for every number through 2007.

(unless there is a pattern, but I doubt there is, because if there was, we would be able to use it to calculate prime numbers, to my knowledge, despite many efforts by many great mathematicians, this has not happened yet.)

If you can solve the problem for the first 20, like I have, without using tedious brute techniques, like I did, please post, I would be very interested to see it done. (If you get close, you might want to check my work, make sure I didn't miss something, and am giving you a false answer to shoot for)

- November 14th 2007, 05:57 PM #21

- Joined
- Nov 2005
- From
- New York City
- Posts
- 10,616
- Thanks
- 10

- November 14th 2007, 06:28 PM #22
Okay, in that case I have a start, maybe someone else can pick up what I don't know.

I would say we can find every instance by the following method:

A, B = random from the set {1,2,3,...,2007}

c,d = real numbers (this includes irrational and negative)

so:

Substitute:

Multiply by d:

Subtract dB

By Quadratic Formula:

-----

Therefore there will be a real solution so long as

So I don't know how to find the probability that this will be the case, but I expect if you can find the probability of this, happening, then you can subtract that from100%, and that will be your answer.

- November 14th 2007, 07:59 PM #23
Okay, I think I have found a way to calculate it, but I would need computer software to make it work

so we need to know the probability that is true. Lets modify the equation to make it more workable.

Add 4A

Square root (B must be positive because it is taken from a set of positive integers)

So now we need to find the probability that this is true for A and B are elements of {1,2,3,...,2007}

So if we assume, A we can figure out the probability for this to be true for B, based on some specific A. In this case, will give us the number of possibilities that B can be which will satisfy the equations. Then divide that by 2007 (the total number of possibilities that B can be, including those that do and those that do not satisfy the equations), and that will give you the percentage that the equations can be satisfied. Meaning cd=A and c+d=B is true (if A is true).

So for any A, the probability that it has real factors whose sum is B is

And so because any given A has a 1 in 2007 chance of being true, then we can multiply that probability against the probability that B will be true for that A, and then count the total probabilities for each A.

Now we just need to count them all. I'm not very familiar with summation notation, but I think this is correct

As i cycles through every value, it will calculate the odds for an A of that value having a B that will satisfy cd=A and c+d=B, then add it to the running total, and when it is done there should be a percentage, between .96 and 1

Okay, so I don't actually know how to do that, (well, I know what it means, but I don't care to sit here for 2007 iterations and calculate the odds) but I think that it is the answer.

Does anyone know an online site which can do this type of equation? If not, perhaps someone can create a quick program to do it (I used to know how to, but it's been too long )

Edit: Looks like if you have a graphing calculator, you can do it Summation (Sigma) Notation Using the Graphing Calculator I, unfortunately, do not have a graphing calculator, but if any of you would plug it in for me, I'd +rep you ^_^ (that's worth like an entire point)

- November 14th 2007, 08:02 PM #24

- Joined
- Nov 2005
- From
- New York City
- Posts
- 10,616
- Thanks
- 10

- November 14th 2007, 08:07 PM #25
I don't know how to do it without software, I'm still in Discrete Math 1, and this is the first summation notation equation I have written on my own, I had to look up how they work just to make sure I did that one right.

Perhaps you would be willing to educate me about the formula?

- November 14th 2007, 10:23 PM #26

- November 15th 2007, 06:53 AM #27

- Joined
- Nov 2005
- From
- New York City
- Posts
- 10,616
- Thanks
- 10

- November 15th 2007, 10:25 PM #28

- Joined
- Nov 2005
- From
- someplace
- Posts
- 14,972
- Thanks
- 4

- November 16th 2007, 09:26 AM #29

- November 18th 2007, 05:32 PM #30

- Joined
- Nov 2005
- From
- New York City
- Posts
- 10,616
- Thanks
- 10

Here is solution to #1. We want that means . But then . And the system of equations always has a solution provided .

So we need to count the number of ways we can get for all pairs . Note if . Then the maximum value is which is always true for . We we just need to count all pairs where .

If then there is no in the pair so that . So the count is 0.

If then there is just in the pair so that . So the count is 1.

If then there is just in the pair so that . So the count is 2.

If then we can pick . So the count is 4.

If then we can pick . So the count is 6.

The question is whether we can find a pattern. Yes! It is based on looking at even and odd cases. Say is even so then in that case . So the count is .

If is odd, so, then . Which means . So the count is .

Now if we write out the numbers as we did for out further we will get:

Where (alternatively)

And (again alternatively) .

This list continous until on the value of . And for is will be .

If we split this sum into even terms in the sequence and odd terms in the sequence we get:

.

But this is for (I just realized it should have been but I am too lazy to change it now. You get the idea).

Now just find the number of pairs for which is just and add to the answer.