How Can You Mentally Factor Numbers Without a Calculator?

  • Thread starter Thread starter qntty
  • Start date Start date
  • Tags Tags
    Factoring Numbers
qntty
Messages
289
Reaction score
4
Does anybody have any good tricks to quickly factor a number in your head, or a trick that can be done quickly on paper? The best method that I know without using a calculator is the traditional method of finding two not-necessarily-prime factors and factoring those with the same method.
 
Physics news on Phys.org
qntty said:
Does anybody have any good tricks to quickly factor a number in your head, or a trick that can be done quickly on paper? The best method that I know without using a calculator is the traditional method of finding two not-necessarily-prime factors and factoring those with the same method.
Google "divisibility rules" or "divisibility tests" . However, mental calculations are generally restricted to working with small numbers and are not generally useful in serious number theory problems, and I don't see any advantage to excluding the use of a calculator.
 
##\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