Author Topic: The Flying Gorilla Problem  (Read 10455 times)

0 Members and 2 Guests are viewing this topic.

Offline Ender

  • Moderator
  • Hero Member
  • *****
  • Posts: 2390
    • View Profile
The Flying Gorilla Problem
« on: October 24, 2006, 07:36:10 pm »
How many ordered pairs of real numbers (s, t) with s and t both between 0 and 1 are there such that both 3s + 7t and 5s + t are integers?

I will post a hint on Thursday.

Edit: edited for clarity.

« Last Edit: October 26, 2006, 03:08:29 pm by Ender »

Offline Joe

  • B&
  • x86
  • Hero Member
  • *****
  • Posts: 10319
  • In Soviet Russia, text read you!
    • View Profile
    • Github
Re: The Flying Gorilla Problem
« Reply #1 on: October 24, 2006, 08:32:22 pm »
What's this have to do with a flying gorilla? I'm disapointed, Ender.
I'd personally do as Joe suggests

You might be right about that, Joe.


Offline Sidoh

  • Moderator
  • Hero Member
  • *****
  • Posts: 17634
  • MHNATY ~~~~~
    • View Profile
    • sidoh
Re: The Flying Gorilla Problem
« Reply #2 on: October 24, 2006, 11:01:52 pm »
Most of these types of problems are tied to some sort of (uselessly entertaining) word problem.

I think the answer is infinitely many, by the way.
« Last Edit: October 25, 2006, 03:32:38 am by Sidoh »

Offline Ender

  • Moderator
  • Hero Member
  • *****
  • Posts: 2390
    • View Profile
Re: The Flying Gorilla Problem
« Reply #3 on: October 25, 2006, 02:30:47 pm »
Joe, that is for you to figure out. Go spend the rest of your life doing so.

[invisible_to_joe]It's meaningless.[/invisible_to_joe]

Sidoh, there are actually a finite number of solutions. This is a REALLY tough problem =), and it requires some creativity.

Offline Sidoh

  • Moderator
  • Hero Member
  • *****
  • Posts: 17634
  • MHNATY ~~~~~
    • View Profile
    • sidoh
Re: The Flying Gorilla Problem
« Reply #4 on: October 25, 2006, 02:38:02 pm »
has an infinite amount of negative components.

Do you mean ordered pair of numbers (s, t) in the set ? :P

Offline Ender

  • Moderator
  • Hero Member
  • *****
  • Posts: 2390
    • View Profile
Re: The Flying Gorilla Problem
« Reply #5 on: October 25, 2006, 02:53:10 pm »
0 < s, t < 1

It's all in the first quadrant.

Offline Sidoh

  • Moderator
  • Hero Member
  • *****
  • Posts: 17634
  • MHNATY ~~~~~
    • View Profile
    • sidoh
Re: The Flying Gorilla Problem
« Reply #6 on: October 25, 2006, 05:20:38 pm »
0 < s, t < 1

It's all in the first quadrant.



Is this what you were intending?  It seems to me that there are an infinite amount of (real) solutions in both the first and fourth quadrants. :P

Aside from that, I don't see how the way numbers fall into quadrants relate to your choice of sets for this problem. :P
« Last Edit: October 25, 2006, 05:24:33 pm by Sidoh »

Offline Ender

  • Moderator
  • Hero Member
  • *****
  • Posts: 2390
    • View Profile
Re: The Flying Gorilla Problem
« Reply #7 on: October 25, 2006, 07:05:45 pm »
Forget what I said about the first quadrant, it was meant to be a hint, not a clarification. It is a hint though.

And the question is correct. There are not an infinite number of ordered pairs (s, t).

Offline Sidoh

  • Moderator
  • Hero Member
  • *****
  • Posts: 17634
  • MHNATY ~~~~~
    • View Profile
    • sidoh
Re: The Flying Gorilla Problem
« Reply #8 on: October 25, 2006, 07:30:08 pm »
Forget what I said about the first quadrant, it was meant to be a hint, not a clarification. It is a hint though.

And the question is correct. There are not an infinite number of ordered pairs (s, t).

You said: .

Do you realize that ? ( is a proper subset of )

Because of this, there are an infinite number of solutions such that .

The numerical solutions to and given your restrictions are always members of if both s and t are members of themselves...
« Last Edit: October 25, 2006, 07:34:22 pm by Sidoh »

Offline Ender

  • Moderator
  • Hero Member
  • *****
  • Posts: 2390
    • View Profile
Re: The Flying Gorilla Problem
« Reply #9 on: October 25, 2006, 09:06:57 pm »
s and t are never members of Z. s and t are both between 0 and 1, on an open-ended interval.

(Too lazy to use latex but will in the future.)

Offline Sidoh

  • Moderator
  • Hero Member
  • *****
  • Posts: 17634
  • MHNATY ~~~~~
    • View Profile
    • sidoh
Re: The Flying Gorilla Problem
« Reply #10 on: October 25, 2006, 09:15:50 pm »
s and t are never members of Z. s and t are both between 0 and 1, on an open-ended interval.

(Too lazy to use latex but will in the future.)

Not at all according to your own specifications.  All you stated is:

s > 0 and t < 1.  contains negative numbers as well...

At this point, I'm thoroughly convinced that: a) You don't understand what I'm saying, b) You wrote the question incorrectly or c) I'm right. :P

Offline Ender

  • Moderator
  • Hero Member
  • *****
  • Posts: 2390
    • View Profile
Re: The Flying Gorilla Problem
« Reply #11 on: October 25, 2006, 10:07:19 pm »
At this point, I'm thoroughly convinced that: a) You don't understand what I'm saying, b) You wrote the question incorrectly or c) I'm right. :P

hehe =)

While some people may be offended by that, it gives me a good laugh. Thank you.

In the statement 0 < s, t < 1 the comma is a separation of variables, not a separation of conditions. As you must have already realized, what it means, or should mean, is that 0 < s < 1 and 0 < t < 1.

I agree it's ambiguous. I did, however, quote it from a reliable source, and don't consider myself an expert in math notation, so I'm not going to take any sides. I resign to ignorance and being bliss.

Anyways, forget the semantics, focus on the problem =) Or something else, just never spend so much time on the semantics of a problem.

I have a bad feeling there's going to be a prolonged discussion on this topic.

Offline Sidoh

  • Moderator
  • Hero Member
  • *****
  • Posts: 17634
  • MHNATY ~~~~~
    • View Profile
    • sidoh
Re: The Flying Gorilla Problem
« Reply #12 on: October 25, 2006, 11:02:58 pm »
just never spend so much time on the semantics of a problem.

The problem doesn't make any sense in the way that I (correctly, I may add :P) interpreted it.

In any case, though, these sorts of problems are widely viewed as a waste of time.  You may get the occasional answer, but unless you're posting something that's seemingly more profound, then don't expect to get many replies.  It's not that people here aren't capable of solving these sorts of questions. :p

I am unaware of any formal mathematical notation where a comma suggests what you're saying this did.  If you're going to post riddles from elsewhere, at least clean up the garbage. :P
« Last Edit: October 25, 2006, 11:17:03 pm by Sidoh »

Offline Ender

  • Moderator
  • Hero Member
  • *****
  • Posts: 2390
    • View Profile
Re: The Flying Gorilla Problem
« Reply #13 on: October 26, 2006, 03:21:16 pm »
This problem is not a waste of time. It just takes a very creative step to simplify it. It exemplifies creativity in mathematics.

Here's the hint that I promised I would give on Thursday. Consider this problem in two dimensions. Let x = 3s + 7t and y = 5s + t. If x and y are both to be integers, then (x, y) will be a lattice point on the graph (a lattice point is the intersection of x = c and y = k where c and k are both integers, or, to put it otherwise, where the gridlines incrementing by one in both dimensions intersect). There are an infinite number of lattice points on the xy plane, but only a finite number in which 3s + 7t and 5s + t are both integers AND where s and t are both between 0 and 1. Find the bounds of the containing shape and then count the lattice points.

Offline Sidoh

  • Moderator
  • Hero Member
  • *****
  • Posts: 17634
  • MHNATY ~~~~~
    • View Profile
    • sidoh
Re: The Flying Gorilla Problem
« Reply #14 on: October 26, 2006, 04:08:47 pm »
This problem is not a waste of time. It just takes a very creative step to simplify it. It exemplifies creativity in mathematics.

I didn't say it was.  Re-read what I said.