How many fish were originally caught by Mr X in total?

  • Thread starter Thread starter bhavinsinh
  • Start date Start date
  • Tags Tags
    Numbers Puzzle
bhavinsinh
numbers puzzle...

Mr X catches 7000 fish appox from a sea.When he lines up the fish in rows of 9 three remain.
These three fish are thrown.He then lines up the remaining fish in rows of 10.THis time two fish remain and again they are thrown in the sea.Finally he lines up the remaining fish in rows of 11 and no fish remain .How many fish were there in the beginning...I know its a common puzzle but I am not able to come up with a solution.a mathematical solution would be appreciated..
 
Last edited by a moderator:
Physics news on Phys.org


Outline of the solution:
The number of fish x = 9n+3 = 110m+5 for natural numbers m, n. Assuming error of 3%, m is between 62 and 65. Hence, there are 6825 fish since 9 divides 110 m + 2 at m = 62.
 
Last edited:

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

How Can a Pelican's Dropped Fish Illustrate Physics Principles?
Replies
7
Views
5K
Challenge Micromass' big statistics challenge
3
Replies
101
Views
13K
Why Are These Discrete Math Problems So Challenging?
Replies
1
Views
2K
Challenge Math Challenge - June 2021
2
Replies
61
Views
9K
What Is the Smallest N That Cannot Be Eliminated Using Modular Arithmetic?
Replies
1
Views
2K
A certain hallway contains a row of lockers numbered from 1 to 30.
Replies
3
Views
2K
I What Is the Minimal Number of Clusters With Shared Descriptors?
Replies
5
Views
2K
Challenge Math Challenge - April 2019
2
Replies
83
Views
21K
The Tetraktysal Kissing Triangle (TK_n) & Lower Bounds of Kissing Numbers to D=10
Replies
6
Views
5K
Need Help 12 Difficult Math questions i need answered by next friday
Replies
2
Views
6K

Hot Threads

Recent Insights

Back
Top