MHB Hectares and kilometres - how many days to cut 295 hectares

  • Thread starter Thread starter Kzerr
  • Start date Start date
  • Tags Tags
    Cut
Kzerr
Messages
3
Reaction score
0
Hello!
I am new to math forums and am not even sure I’m in the right thread but will give it a go!
I am trying to determine how many days it will take to mow 295 hectares when my mower has a blade 12’ wide and can move at 4km/hour.
Attached is what I believe to be correct but am uncertain if you can cross multiply squared numbers.
Thanks in advance!
 

Attachments

  • 5E61FFA5-C521-4A48-B7C1-8CE298410355.jpeg
    5E61FFA5-C521-4A48-B7C1-8CE298410355.jpeg
    1.1 MB · Views: 124
Physics news on Phys.org
You can cross multiply NUMBERS. How you got the numbers, by squaring or other wise, is irrelevant.
 
Ok - does this look correct to you then?
 
Country Boy said:
You can cross multiply NUMBERS. How you got the numbers, by squaring or other wise, is irrelevant.
Right, ok so then do you believe the equation in the photo to be correct then?
 
##\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...
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...
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...
Back
Top