Intereting Posts

How to integrate $\int_1^\infty \frac{dx}{x^2\sqrt{x^2-1}}$?
Prove Quotient Group Isomorphism
Is Pigeonhole Principle the negation of Dedekind-infinite?
Finding the power series for $y$ where $y + \sin(y) = x$
Why do the elements of finite order in a nilpotent group form a subgroup?
Showing that a certain map is not flat by explicit counterexample
Showing that $x^n -2$ is irreducible in $\mathbb{Q}$
Count the number of n-bit strings with an even number of zeros.
Universe cardinals and models for ZFC
Is a von Neumann algebra just a C*-algebra which is generated by its projections?
Why Do Structured Sets Often Get Referred to Only by the Set?
Combinatorics problem: $n$ people line up to $m$ clubs
Prove $ \sum \frac{\cos n} { \sqrt n}$ converges
Does the square or the circle have the greater perimeter? A surprisingly hard problem for high schoolers
Weak *-topology of $X^*$ is metrizable if and only if …

This is a very interesting word problem that I came across in an old textbook of mine. So I know its got something to do with prime numbers, but other than that, the textbook gave no hints really and I’m really not sure about how to approach it.

So anyway, here the problem goes:

The $\text{Factof}$ (Integer on number of factors) of an integer is the integer divided by the number of factors it has. For example, $18$ has $6$ factors so $\text{Factof}(18) = \frac{18}{6} = 3$, and $27$ has $4$ factors so $\text{Factof}(27) = \frac{27}{4} = 6.75$.

- Question related to pseudoprimes and Carmichael numbers
- Are exact representations of numbers in fractional bases unique?
- Fibonacci identity: $f_{n-1}f_{n+1} - f_{n}^2 = (-1)^n$
- Proof verification: Let $a$ be an irrational number and $r$ be a nonzero rational number. If $s$ is a rational number then $ar$ + $s$ is irrational
- Why can't prime numbers satisfy the Pythagoras Theorem? That is, why can't a set of 3 prime numbers be a Pythagorean triplet?
- Divisors of all values of polynomial over $\Bbb Z\,$ (fixed divisors)
Show that the square of any prime number is the $\text{Factof}$ of some integer.

**Edit: I have reworded the question so that it is more specific and can be answered coherently in the context of the rules.**

- An irreducible $f\in \mathbb{Z}$, whose image in every $(\mathbb{Z}/p\mathbb{Z})$ has a root?
- Eigenvalue of an Euler product type operator?
- Distribution of prime numbers. Can one find all prime numbers?
- Quick algorithm for computing orders mod n?
- Asymptotic Distribution of Prime Gaps in Residue Classes
- Does $\lfloor \sqrt{p} \rfloor$ generate all natural numbers?
- Is there a direct proof of this lcm identity?
- When does a polynomial take all possible residues modulo any integer?
- Conjecture: the sequence of sums of all consecutive primes contains an infinite number of primes
- Solving $ax \equiv c \pmod b$ efficiently when $a,b$ are not coprime

Given the prime $p\neq 3$, the integer number you are looking for is $n(p) = 3^2p^2$. It has $3^2 = 9$ factors ($1$, $3$, $p$, $3p$, $3^2p$, $3p^2$, $3^2$, $p^2$, $3^2p^2$) and

$$

\mbox{Factof}(n(p)) = \frac{3^2p^2}{3^2} = p^2

$$

If $p=3$ then the number $n(p)=2^2 3^3 = 108$. In this case

$$

\mbox{Factof}(108) = \frac{2^23^3}{2^2 3} = 3^2

$$

*‘A prime no. always has two factors.’*

So the product of two primes $p$ and $q$ will have $4$ factors:

$1$, $p$, $q$, $pq$

Now if the primes are distinct then the product $pq$ is not a multiple of $4$ since $2$ is the only even prime (and hence the other prime will be odd).

So, $\text{Factof}(pq)$ is not an integer.

*For (b) part,*

Number of factors of ${(pq)}^4$ = $25$

So, for the $\text{Factof}{(pq)}^4$ to be an integer, it needs to be divisible by $25$ or in other words,

${(pq)}^4$ = $25k$ where $k$ is some integer

*For (c) part,*

I’m still working on the (c) part but maybe these inputs might help:

Notice that the $\text{Factof}$ of that integer has to be an integer itself in the first place.

It also needs to be the square of a prime no.

So the integer must be equal to the product of its number of factors and the square of a prime number.

Moreover, every integer $I$ can be expressed as:

$I$ = ${p_1}^{k_1}\cdot{p_2}^{k_2}\cdot{p_3}^{k_3}…$

where ${p_1}, {p_2}, {p_3}$ are distinct prime nos. and ${k_1}, {k_2}, {k_3}$ are integers.

same question here what a coincidence !!1!1!

a) 4

b)all primes have 2 factors and by multiplying 2 primes you get 4 factors,

the product of these factors must be divisible by 4 and 2 is the only even prime number however 2 x all the other primes NEVER equal a multiple of 4 therefore the answer is never an integer (basically, you can reword and explain more)

c) so far all I’ve got is 2 as P, then 5 as q and then reverse it so 5 as p and 2 as q (I’m sure you can figure out why) bu basically

5 x 2^4 or 16 = 80

80 has 10 factors

80 divided by 10 = 8 which is an integer!

IF anyone can help with D then plz HMU coz i don’t think anyone in Australia has figured this IONOF question

xox and doing my part for all those struggling maths students

- Why is the sheaf $\mathcal{O}_X(n)$ called the “twisting sheaf” (where $X=\operatorname{Proj}(S)$ for a graded ring $S$)?
- To find all odd integers $n>1$ such that $2n \choose r$ , where $1 \le r \le n$ , is odd only for $r=2$
- what type of math is this?
- What does it mean to say “a divides b”
- Why is the range of inverse trigonometric functions defined in this way?
- Proof that $\dim(U_1+U_2) = \dim U_1 + \dim U_2 – \dim(U_1\cap U_2)$
- How to calculate the Fourier transform of a Gaussian function.
- Proof Verification – Every sequence in $\Bbb R$ contains a monotone sub-sequence
- How to compute the residue of a complex function with essential singularity
- How do I show that the sum of residuals of OLS are always zero using matrices
- Four turtles/bugs puzzle
- Euler's formula for connected planar graphs
- Units in a polynomial ring
- Rank-nullity theorem for free $\mathbb Z$-modules
- Boundedness of $L^2$-norms of mixed derivatives of functions from $W^{2,2}(\mathbb{R}^N)$