×

# Counterfeit

Greetings Everyone😊! While solving several types of mathematical problems I came across a lot of problems in which one has to search for a counterfeit coin among 10, 20, 80 or even 1000 similar coins. Now trying all the possible cases for 1000 coins is nearly impossible manually. So I want to generalize all such problems. Of course there is no other platform better than brilliant for such a problem. So here is the question: Q. Generate a function f(n) such that the input n is the number of similar object (coins,balls etc.) and the output f(n) gives the minimum number of ways in which we can find one counterfeit object (of different mass than the others) using weight balance.

Note by Sarthak Tanwani
2 years, 9 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$