Challenge ’16 The Answers.

Slides:



Advertisements
Similar presentations
Request Dispatching for Cheap Energy Prices in Cloud Data Centers
Advertisements

SpringerLink Training Kit
Luminosity measurements at Hadron Colliders
From Word Embeddings To Document Distances
Choosing a Dental Plan Student Name
Virtual Environments and Computer Graphics
Chương 1: CÁC PHƯƠNG THỨC GIAO DỊCH TRÊN THỊ TRƯỜNG THẾ GIỚI
THỰC TIỄN KINH DOANH TRONG CỘNG ĐỒNG KINH TẾ ASEAN –
D. Phát triển thương hiệu
NHỮNG VẤN ĐỀ NỔI BẬT CỦA NỀN KINH TẾ VIỆT NAM GIAI ĐOẠN
Điều trị chống huyết khối trong tai biến mạch máu não
BÖnh Parkinson PGS.TS.BS NGUYỄN TRỌNG HƯNG BỆNH VIỆN LÃO KHOA TRUNG ƯƠNG TRƯỜNG ĐẠI HỌC Y HÀ NỘI Bác Ninh 2013.
Nasal Cannula X particulate mask
Evolving Architecture for Beyond the Standard Model
HF NOISE FILTERS PERFORMANCE
Electronics for Pedestrians – Passive Components –
Parameterization of Tabulated BRDFs Ian Mallett (me), Cem Yuksel
L-Systems and Affine Transformations
CMSC423: Bioinformatic Algorithms, Databases and Tools
Some aspect concerning the LMDZ dynamical core and its use
Bayesian Confidence Limits and Intervals
实习总结 (Internship Summary)
Current State of Japanese Economy under Negative Interest Rate and Proposed Remedies Naoyuki Yoshino Dean Asian Development Bank Institute Professor Emeritus,
Front End Electronics for SOI Monolithic Pixel Sensor
Face Recognition Monday, February 1, 2016.
Solving Rubik's Cube By: Etai Nativ.
CS284 Paper Presentation Arpad Kovacs
انتقال حرارت 2 خانم خسرویار.
Summer Student Program First results
Theoretical Results on Neutrinos
HERMESでのHard Exclusive生成過程による 核子内クォーク全角運動量についての研究
Wavelet Coherence & Cross-Wavelet Transform
yaSpMV: Yet Another SpMV Framework on GPUs
Creating Synthetic Microdata for Higher Educational Use in Japan: Reproduction of Distribution Type based on the Descriptive Statistics Kiyomi Shirakawa.
MOCLA02 Design of a Compact L-­band Transverse Deflecting Cavity with Arbitrary Polarizations for the SACLA Injector Sep. 14th, 2015 H. Maesaka, T. Asaka,
Hui Wang†*, Canturk Isci‡, Lavanya Subramanian*,
Fuel cell development program for electric vehicle
Overview of TST-2 Experiment
Optomechanics with atoms
داده کاوی سئوالات نمونه
Inter-system biases estimation in multi-GNSS relative positioning with GPS and Galileo Cecile Deprez and Rene Warnant University of Liege, Belgium  
ლექცია 4 - ფული და ინფლაცია
10. predavanje Novac i financijski sustav
Wissenschaftliche Aussprache zur Dissertation
FLUORECENCE MICROSCOPY SUPERRESOLUTION BLINK MICROSCOPY ON THE BASIS OF ENGINEERED DARK STATES* *Christian Steinhauer, Carsten Forthmann, Jan Vogelsang,
Particle acceleration during the gamma-ray flares of the Crab Nebular
Interpretations of the Derivative Gottfried Wilhelm Leibniz
Advisor: Chiuyuan Chen Student: Shao-Chun Lin
Widow Rockfish Assessment
SiW-ECAL Beam Test 2015 Kick-Off meeting
On Robust Neighbor Discovery in Mobile Wireless Networks
Chapter 6 并发:死锁和饥饿 Operating Systems: Internals and Design Principles
You NEED your book!!! Frequency Distribution
Y V =0 a V =V0 x b b V =0 z
Fairness-oriented Scheduling Support for Multicore Systems
Climate-Energy-Policy Interaction
Hui Wang†*, Canturk Isci‡, Lavanya Subramanian*,
Ch48 Statistics by Chtan FYHSKulai
The ABCD matrix for parabolic reflectors and its application to astigmatism free four-mirror cavities.
Measure Twice and Cut Once: Robust Dynamic Voltage Scaling for FPGAs
Online Learning: An Introduction
Factor Based Index of Systemic Stress (FISS)
What is Chemistry? Chemistry is: the study of matter & the changes it undergoes Composition Structure Properties Energy changes.
THE BERRY PHASE OF A BOGOLIUBOV QUASIPARTICLE IN AN ABRIKOSOV VORTEX*
Quantum-classical transition in optical twin beams and experimental applications to quantum metrology Ivano Ruo-Berchera Frascati.
The Toroidal Sporadic Source: Understanding Temporal Variations
FW 3.4: More Circle Practice
ارائه یک روش حل مبتنی بر استراتژی های تکاملی گروه بندی برای حل مسئله بسته بندی اقلام در ظروف
Decision Procedures Christoph M. Wintersteiger 9/11/2017 3:14 PM
Limits on Anomalous WWγ and WWZ Couplings from DØ
Presentation transcript:

Challenge ’16 The Answers

Ken’s Grandmothers Ken, who lives in Liverpool, has two grandmothers; Gladys lives in Southport and Audrey in Chester. He goes to see them by train from Liverpool Central Station, at no particular fixed time. To avoid deciding whom to visit, he always takes the first possible train to either destination when he arrives at the station. There is one train every fifteen minutes to each destination, so he thinks this is fair. However, Ken finds that over time he sees Gladys four times as often as Audrey. Explain how this is so.

Ken’s Grandmothers The train to Southport leaves at 00, 15, 30 and 45 minutes past the hour. The train to Chester leaves at 03, 18, 33 and 48 minutes past the hour.

Ken’s Grandmothers So for 3 minutes in every 15, the next train will be the Chester train and for 12 minutes in every 15 it will be the Southport train. This gives us the 1:4 ratio.

Suitcase Roulette Rob, Michael and Alyssa arrive at Marseille Provence Airport. Their three suitcases are identical, and the name labels were mixed up at check-in so that no label is on the right luggage! Alyssa remarks that she brought no socks; both the others confirm aloud that they did pack socks. Rob picks up a suitcase and glances at its name label. He then begins to open it and a pair of socks falls out. ‘Ah!’ Rob exclaims, without looking inside. ‘This suitcase is obviously mine.’ Explain how Rob could know. Whose name is on his suitcase? Which labels are on Michael’s suitcase and on Alyssa’s suitcase?

Alyssa Rob Michael Suitcase Roulette Given that a sock has fallen out, it is not Alyssa’s. Since Rob knows it is his, it must have Michael’s name on it. If it said Alyssa’s, he would not know. Alyssa’s suitcase must have Rob’s name on it Michael’s case must have Alyssa’s name on it. Alyssa Rob Michael

To B or Not To B? A town planner decides to introduce a new one-way system, as shown on the map. The arrows indicate the direction of traffic flow on each street. Show that you can get from A to every street in the town. Can you leave from every street to get to B?

To B or Not To B?

To B or Not To B? C is a closed loop, there is no escape!

French Wanderings Rob, Michael and Alyssa are going to France for the EURO 2016 tournament. Their flights are into and out of Marseille. They plan to attend one match there and also visit every other host city in the south of the country; they do not wish to pass through cities more than once during their tour. Help them to find the shortest route in km around the venues, from the start to the end of their trip. Indicate your strategy and state the total length of the shortest route. (Striking French lorry drivers are preventing interchange between the Nice – Toulouse road and the two roads which it crosses!)

French Wanderings 1915km Nice Marseille Lyon St-Etienne Toulouse Nearest neighbour algorithm   Nice Marseille Lyon St-Etienne Toulouse Bordeaux 205 400 320 335 560 470 555 535 245 60 1915km

French Wanderings Proof by exhaustion MNLBSTM = 2700km MNLBTSM = 2345km MNTBSLM = 1925km MNTBLSM = 1960km MNTSBLM = 2710km MLNTBSM = 2465km MSBLNTM = 2855km MNLSBTM = 1915km and reverse routes.

Tunnel Vision The Queensway Tunnel under the River Mersey has 4 traffic lanes: a fast and a slow lane in each direction. Vehicles in the fast lane travel at 55kph and are 25 metres apart. Vehicles in the slow lane travel at 35kph and are 20m apart. When being driven through the tunnel, Alex and Matthew play a game of counting the vehicles that they pass heading the other way. Alex counts the vehicles in the fast lane, whilst Matthew counts the vehicles in the slow lane. Who counts more vehicles if the boys’ car is in the fast lane and who counts more if it is in the slow lane?

Tunnel Vision

Tunnel Vision If they are in the fast lane: Alex counts (55,000+55,000)/25 = 4400 cars per hour; Matthew counts (55,000+35,000)/20 = 4500 cars per hour. So Matthew counts more cars.

Tunnel Vision In the slow lane: Alex counts (35,000 + 55,000)/25 = 3600 cars per hour; Matthew counts (35,000+35,000)/20 = 3500 cars per hour. So Alex counts more in the slow lane.

Arrowhead Island Arrowhead Island has just five small towns. Cold Harbour is at the northern tip of the island and Eastward Ho is on the Eastern side. Aberbay, Burnmouth and Deepcove are also all on the coast. There are just two roads: one goes around the coast visiting all five towns; the other goes across the island from one town to another. The mileage table shows the shortest distance by road between the five towns. Make a road map of the island. B 4   C 7 11 D 2 3 9 E 6 10 A

Arrowhead Island Cold Harbour 7 10 Aberbay B 4 C 7 11 D 2 3 9 E 6 10 A   C 7 11 D 2 3 9 E 6 10 A 4 2 Deepcove CE < any via route, so direct road D is closest to E, A is closest to C Burnmouth 3 4 Eastward Ho

Trains in the Tunnel There is a railway tunnel under the River Mersey between Hamilton Square and James Street stations. Each train takes exactly 3 minutes to travel between these stations in either direction. Trains leave Hamilton Square for James Street at these minutes past the hour: 01, 06, 11, 14, 16, 21, 26, 31, 36, 41, 44, 46, 51, 56. Trains leave James Street for Hamilton Square at these minutes past the hour: 02, 07, 12, 17, 22, 24, 27, 32, 37, 42, 47, 52, 54, 57. For which minutes in a given hour will the tunnel be empty? For which minutes in a given hour will there be trains in the tunnel running in both directions simultaneously?

Trains in the Tunnel HS to JS trains JS to HS trains With no trains in the tunnel at all – 00, 05, 10, 20, 30, 35, 40, 50. Trains running in both directions – 02, 03, 07, 08, 12, 13, 14, 17, 18, 22, 23, 26, 27, 28, 32, 33, 37, 38, 42, 43, 44, 47, 48, 52, 53, 56, 57, 58.

Ella and Siân Ella and Siân have cycled 16km from home, when the back wheel of Ella’s bicycle falls off. Ella is fortunately uninjured (a rarity for Ella) and so they decide to set off for home, leaving her bicycle secured to a tree. They agree that Ella will start walking and Siân will start on her bicycle. After some time, Siân will leave the bicycle locked to a lamp post and continue on foot so that, when Ella reaches the bicycle, she can unlock it (they both have a key for the lock) and use it to cycle the rest of the journey. Ella walks at 4km per hour and cycles at 10km per hour; Siân walks at 5km per hour and cycles at 12 km per hour. For what length of time should Siân ride the bicycle, so that they both arrive home together, and how long will the whole journey take them?

Ella and Siân Let x be the point along the route where the bicycle has been left. Then Ella’s journey takes 𝑥 4 + (16−𝑥) 10 And Siân’s journey takes 𝑥 12 + (16−𝑥) 5 These need to be the same, so the equation is 𝑥 4 + 16−𝑥 10 = 𝑥 12 + 16−𝑥 5

Ella and Siân Common denominators gives 10𝑥+64−4𝑥 40 = 5𝑥+192−12𝑥 60 Multiplying through gives 36𝑥+384=768−28𝑥 So 64𝑥=384∴𝑥=6 The whole journey takes 2.5 hours Ella walks for 1.5 hours, then cycles for 1 hour Siân cycles for 0.5 hours, then walks for 2 hours.

Ella and Siân