Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "User talk:Bobthesmartypants"

(→‎Answers)
(→‎Bobthesmartypants's problem set)
 
(12 intermediate revisions by 2 users not shown)
Line 1: Line 1:
−
==Bobthesmartypants's question collection==
+
==Introduction==
−
'''Problem 1.''' Bob is rolling a <math>6</math>-sided die. Every time he rolls a number that he has already rolled before, he rolls again. He stops when he has rolled all the numbers. What is the expected number of rolls it will take Bob?
+
Hello, I am bobthesmartypants. This is my ever-expanding problem set that I made up completely, and am contwinuing to make up. Please refrain from editing the problems page, but if you have an alternate solution to a problem or disagree with a solution, feel free to PM me. Hope you have fun solving these problems!
  
−
'''Problem 2.''' Suppose you have a rectangular box, with side lengths <math>a</math> and <math>b</math>, where <math>a,b\in\mathbb{Z}</math>. We launch a point-like ball from one of the vertices with an angular degree of <math>60^{\circ}</math>. The ball bounces off the sides of the box. Pretend there is no friction, drag, or anything else to slow down the ball. Prove or disprove that the ball won't ever hit a vertex again.
+
''Note: I may be transferring this to my Blog. Check it out when I do so!''
  
−
'''Problem 3.''' In a country, there is a particular way the cities inside are connected. One city has only one road leading out of it. One city has two roads leading out of it. Two cities have three roads leading out of it. Three cities have 5 roads leading out of it. In general, <math>F_n</math> cities have <math>F_{n-1}</math> roads leading out of it. What values of <math>n</math> are there such that this setup is possible?
+
==Bobthesmartypants's problem set==
 +
 
 +
[[User talk:Bobthesmartypants/Problems]]
  
 
[[User talk:Bobthesmartypants/Solutions]]
 
[[User talk:Bobthesmartypants/Solutions]]
 +
 +
==Sandbox==
 +
 +
[[User talk:Bobthesmartypants/Sandbox]]

Latest revision as of 22:51, 8 October 2013

Introduction

Hello, I am bobthesmartypants. This is my ever-expanding problem set that I made up completely, and am contwinuing to make up. Please refrain from editing the problems page, but if you have an alternate solution to a problem or disagree with a solution, feel free to PM me. Hope you have fun solving these problems!

Note: I may be transferring this to my Blog. Check it out when I do so!

Bobthesmartypants's problem set

User talk:Bobthesmartypants/Problems

User talk:Bobthesmartypants/Solutions

Sandbox

User talk:Bobthesmartypants/Sandbox

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=User_talk:Bobthesmartypants&oldid=57214"