Jun 15, 2025
Оfftopic Community
Оfftopic Community
Forums
New posts
Search forums
What's new
Featured content
New posts
New media
New media comments
New resources
New profile posts
Latest activity
Media
New media
New comments
Search media
Resources
Latest reviews
Search resources
Members
Current visitors
New profile posts
Search profile posts
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Forums
Mobile
Carriers
Bell
Each time Shannon pushes the button on a machine, a bell rings 7 times. Each
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
<blockquote data-quote="coolkid70" data-source="post: 1957152" data-attributes="member: 714434"><p>1) There are a few ways to solve this. Suppose that you have absolutely no mathematical machinery under your belt and are reduced to guessing. You can see that 23 is not divisible by either 3 or 7, so you can check: can he flip the switch once? That leaves 20 bell rings. 20 is not divisible by 7, so you try again. Can he flip the switch twice? That leaves 17 bell rings. Still no good. What about three times? That leaves 14 bell rings, which is divisible by 7! So, one possible setup can be two button pushes and three switch flips. (If you keep going, you will note that there are no more solutions).</p><p></p><p>2) You can use the digits 1, 3, 5 for each digit in your three-digit number. So you have three decimal places and three choices for each place, so that gives you 3 * 3 * 3 = 3^3 = 27 numbers satisfying the criterion.</p><p></p><p>3) Let's expand out the right hand side. (x + b)^2 = x^2 + 2bx + b^2. All we have to do is compare the coefficients of the left side to the right side. We see that 2b = 16 and b^2 = a. From the first relation, we know that b = 8. Therefore, a = (8)^2 = 64.</p><p></p><p>That should do it.</p></blockquote><p></p>
[QUOTE="coolkid70, post: 1957152, member: 714434"] 1) There are a few ways to solve this. Suppose that you have absolutely no mathematical machinery under your belt and are reduced to guessing. You can see that 23 is not divisible by either 3 or 7, so you can check: can he flip the switch once? That leaves 20 bell rings. 20 is not divisible by 7, so you try again. Can he flip the switch twice? That leaves 17 bell rings. Still no good. What about three times? That leaves 14 bell rings, which is divisible by 7! So, one possible setup can be two button pushes and three switch flips. (If you keep going, you will note that there are no more solutions). 2) You can use the digits 1, 3, 5 for each digit in your three-digit number. So you have three decimal places and three choices for each place, so that gives you 3 * 3 * 3 = 3^3 = 27 numbers satisfying the criterion. 3) Let's expand out the right hand side. (x + b)^2 = x^2 + 2bx + b^2. All we have to do is compare the coefficients of the left side to the right side. We see that 2b = 16 and b^2 = a. From the first relation, we know that b = 8. Therefore, a = (8)^2 = 64. That should do it. [/QUOTE]
Insert quotes…
Name
Verification
Please enable JavaScript to continue.
Loading…
Post reply
Top