Bitcoin Forum
June 15, 2024, 12:19:32 PM *
News: Latest Bitcoin Core release: 27.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: [1]
  Print  
Author Topic: Whoever Can Solve This Problem Is a Genius  (Read 383 times)
Virtual Exchange (OP)
Newbie
*
Offline Offline

Activity: 24
Merit: 0


View Profile
November 09, 2015, 05:38:13 AM
 #1

There are 12 people going on a road trip in three cars. To make it fun, they will rotate between the three vehicles every time they stop. Only five people feel comfortable driving, so how many ways can I arrange the drivers and passengers among the three cars assuming order doesn't matter?

The problem is dealing with combinations (not permutations). This problem is very hard!
Lethn
Legendary
*
Offline Offline

Activity: 1540
Merit: 1000



View Profile WWW
November 09, 2015, 05:44:50 AM
 #2

I hate maths problems like this as they're not grounded in reality and are why I got such low scores on my maths GSCE's.

1. Pay for an extra driver so the number between them is even and you can rotate them in shifts

2. Hire a bus or other large vehicle that can take 12 people instead of taking three cars

I realise there's a proper mathematical solution for this, but if people are going to make up a problem like this they need to make them genuinely difficult rather than place artificial limits on how you solve them.
Gleb Gamow
In memoriam
VIP
Legendary
*
Offline Offline

Activity: 1428
Merit: 1145



View Profile
November 09, 2015, 08:16:21 AM
 #3

I hate maths problems like this as they're not grounded in reality and are why I got such low scores on my maths GSCE's.

1. Pay for an extra driver so the number between them is even and you can rotate them in shifts

2. Hire a bus or other large vehicle that can take 12 people instead of taking three cars

I realise there's a proper mathematical solution for this, but if people are going to make up a problem like this they need to make them genuinely difficult rather than place artificial limits on how you solve them.

There are 12 sockpuppets taking crypto enthusiast and investors for a ride. To make it fun, they rotate among themselves each time their ventures are declared scams. Only five suckpuppets feel comfortable driving the sheep, so how many ways can the sockpuppets, current and future scam sites, and sheep be arranged so that BitcoinTalk can remain solvent via ad revenue?

Is that grounded in reality enough for you?
Lethn
Legendary
*
Offline Offline

Activity: 1540
Merit: 1000



View Profile WWW
November 09, 2015, 09:24:18 AM
 #4

Rofl! Cheesy But here's the problem, as we've seen scammers have absolutely no problems on this site creating as many accounts as they like screwing with people, so how can they only have five?

By the way, can you see why I had so much trouble with my GCSE's? I went through this with my driving theory test as well but I needed a license so I stuck with it.
Gleb Gamow
In memoriam
VIP
Legendary
*
Offline Offline

Activity: 1428
Merit: 1145



View Profile
January 08, 2016, 09:08:50 AM
 #5

I hate maths problems like this as they're not grounded in reality and are why I got such low scores on my maths GSCE's.

1. Pay for an extra driver so the number between them is even and you can rotate them in shifts

2. Hire a bus or other large vehicle that can take 12 people instead of taking three cars

I realise there's a proper mathematical solution for this, but if people are going to make up a problem like this they need to make them genuinely difficult rather than place artificial limits on how you solve them.

There are 12 sockpuppets taking crypto enthusiast and investors for a ride. To make it fun, they rotate among themselves each time their ventures are declared scams. Only five suckpuppets feel comfortable driving the sheep, so how many ways can the sockpuppets, current and future scam sites, and sheep be arranged so that BitcoinTalk can remain solvent via ad revenue?

Is that grounded in reality enough for you?


Bump, so that new fellow monumental assholes can enjoy this year.
Pages: [1]
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!