What is the capital of Bangladesh?
Dhaka
When was the Declaration of Independence signed?
July 2nd, 1776
Coin Flip
:D
Probability that you roll a 7 on a 6-sided die
0
What is 67?
It is 67
What is the farthest point from the center of the earth on earth's surface?
Chimborazo
What was Tokyo called before it was named Tokyo?
Edo
Capital of Thailand (Full name)
Krung Thep Maha Nakhon Amon Rattanakosin Mahinthara Ayutthaya Mahadilok Phop Noppharat Ratchathani Burirom Udomratchaniwet Mahasathan Amon Piman Awatan Sathit Sakkathattiya Witsanukam Prasit
probability that you roll a 6 then a 2 on a 6-sided die
1/36
Capital of Panama
Panama city
What canal was dug to cross the narrow gap between the Red and Mediterranean Sea that is not the Suez Canal?
The Canal of the Pharaohs
Name the Caliphate that was in the golden age of Islam.
Abbasid Caliphate
Free points
:)
A club is going to send 4 of its 10 members to represent the club at a conference.
How many different groups of 4 members can they send?
210
What is the quadratic formula?
What mountain can you go up in a gondola and have a great view of Banff?
Sulfur Mountain
How long was the hundred years' war?
116 years
6+7
Declan's friend Luka claims that he can read minds. To test Luka's abilities, Declan draws 5 cards without replacement from a standard deck of 2 playing cards. Declan then asks Luka to identify in any order which 5 cards he drew without looking.
Assume that Luka has no special abilities and is randomly guessing the cards.
What is the probability that Luka correctly identifies all 5 cards in any order?
1/2598960
1
1,1
1,2,1
1,3,3,1
1,4,6,4,1
1,5,10,10,5,1
1,6,15,20,15,6,1
What is the tallest mountain in Chad?
Emi Koussi
When did the country Siam fall?
Most populous city in the world.
Chongqing, Tokyo, Jakarta, Yangtze River Delta Megalopolis
Mateo is playing a word game where he's trying to make 4-letter words by rearranging the letters in the word IRON.
How many unique ways are there to arrange the letters in the word IRON?
24
What is stars and bars?
A formula to find the amount of ways you can put x indistinct objects into y distinct containers. The formula for it is
(n+k-1) choose (n) or (k-1)