Source: Cute problem sent by Sudeep Kanath
Problem: Prove that (2n choose n) is never a perfect power
Update ( 21 June 2014 ):
Solution: Posted by Sandeep, Dinesh Krithivasan and Vishal Khatri in comments.
Quant, Math & Computer Science Puzzles for Interview Preparation & Brain Teasing
A collection of ~225 Puzzles with Solutions (classified by difficulty and topic)
Feb 16, 2014
Feb 10, 2014
Coin Problem  Wolfram Mathematica Puzzle
Problem:
Suppose you have an infinite stock of $a bills and $b bills such that g.c.d(a,b)=1. Find the largest amount of money (integer) that cannot be represented using $a and $b denominations.
Shameless plug:
If you have not done it already, please like / +1 / follow on: Quora, Twitter, Facebook, G+
Update (21 June 2014):
Solution: Posted by Raunak Kudesia, Sid Hollander and me (Pratik) in comments!
Solution: Posted by Raunak Kudesia, Sid Hollander and me (Pratik) in comments!
Subscribe to:
Posts (Atom)
Fraction Brainteaser
Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20...

This is not a puzzle. So, for those of you who follow this puzzle blog, please bear with me for just one post. Interesting Math in this art...

Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20...

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tos...