# Tagged Questions

46 views

### Regarding 'non-square- free ' numbers.

Call an integer 'n' that is not a square or a prime power or a square-free a 'square-in'.Let n be square-in. Then between n and (2 n) is there another square-in? This is a kind of 'variation' on ...
29 views

### Regarding square-free numbers and their doubles.

Is it true that between any non-prime square-free number and it's double is another non-prime square-free number?
76 views

### Proof by induction: $n$th Fibonacci number is at most $2^n$

I'm trying to find the proof by induction of the following claim: For all $n\in\mathbb N$, $\operatorname{fibonacci}(n) \le 2^n$ My Proof: Base case: $n = 1$ $\operatorname{fibonacci}(1) \le 2^ 1$ ...
26 views

### Inequality involving floor function and fractions

I have little to no experience working with floor inequalities so I am kind of stuck on this one. It seems pretty intuitive though. So basically I want to show that ...
38 views

### A question related to the Descartes-Frenicle-Sorli conjecture on odd perfect numbers

Good day to everyone! I apologize in advance for the somewhat long post, but I had to put in all the details into a single question to communicate what I believe to be a viable approach to odd ...
33 views

54 views

### Bounds on functions using inequalities?

I'm studying inequalities as part of a course on Numbers, Proofs and Mathematical Induction. There is one type of question that I don't understand, primarily because there's only one example in the ...
53 views

### If distinct numbers $a,b,c\in\mathbb N^+$ satisfy $(a+b)(a+c)=(b+c)^2$, prove that $(b-c)^2>8(b+c)$.

If distinct numbers $a,b,c\in\mathbb N^+$ satisfy $$(a+b)(a+c)=(b+c)^2$$prove that $$(b-c)^2>8(b+c).$$ The first thing I did after I saw the problem was turning the inequality into this: ...
61 views

### Let $a_1,a_2,\ldots,a_{100}$ be real numbers,each less than one,satisfy $a_1+a_2+\ldots+a_{100} >1$.

Let $a_1,a_2,\ldots,a_{100}$ be real numbers,each less than one,satisfy $$a_1+a_2+\ldots+a_{100}>1$$ Prove the following statements: (i) Let $n_0$ be the smallest integer $n$ such that ...
38 views

### Is $\frac{k!!}{j!!(k-j)!!}\leq\frac{k!}{j!(k-j)!}$ for all integers $j$ and $k$, where $0\leq j\leq k$?

For all integers $j$ and $k$, where $0\leq j\leq k$, is the inequality $\frac{k!!}{j!!(k-j)!!}\leq\frac{k!}{j!(k-j)!}$ true? I have a feeling that it is and it would be helpful to me if it is, ...
29 views

### Proving that a certain sequence is bounded from above

Let $p_1,p_2,p_3,..$ be the sequence of primes in increasing order ($p_1=2,p_2=3,...$) .Let $x_n$ be given by: ...
35 views

### $\frac{2}{\frac{a}{x}+\frac{b}{y}}\leq ax+by$

$\frac{2}{\frac{a}{x}+\frac{b}{y}}\leq ax+by$, where a+b=1 and $a,b,x,y>0$ real numbers. Any hints? part (a) was showing $\frac{2}{\frac{1}{x}+\frac{1}{y}}\leq \sqrt{xy}\leq \frac{x+y}{2}$. To ...
54 views

### Let $a_1,a_2,\ldots,a_{100}$ be real numbers,each less than one,satisfy $a_1+a_2+\ldots+a_{100} >1$.Prove the following statements

Let $a_1,a_2,\ldots,a_{100}$ be real numbers,each less than one,satisfy $$a_1+a_2+\ldots+a_{100}>1$$ Prove the following statements: (i) Let $n_0$ be the smallest integer $n$ such that ...
101 views

### If $a_1+a_2+\ldots+a_{2000}>a_1a_2\ldots a_{2000}$, prove that at least $1990$ of those numbers are equal to $1$.

If $a_1,a_2,\ldots,a_{2000}\in\mathbb N$ and$$a_1+a_2+\ldots+a_{2000}>a_1a_2\ldots a_{2000}$$ Prove that at least $1990$ of those numbers are equal to $1$. That's an unusual problem for me and I ...
85 views

### If $m,n\in \mathbb N$ and $n>m$, prove that $lcm(m,n)+lcm(m+1,n+1)>\frac{2mn}{\sqrt{n-m}}$.

Where $lcm$ is the least common multiple. I've changed it to: $$\frac{mn}{\gcd(m,n)}+\frac{(m+1)(n+1)}{\gcd(m+1,n+1)}>\frac{2mn}{\sqrt{n-m}}$$ Can't see how to continue. Is there a way to ...
153 views

### Which is larger :: $y!$ or $x^y$, for numbers $x,y$.

This is a generalization of this question :: Which is larger? $20!$ or $2^{40}$?. No explicit general solution was presented there and I'm just curious :D Thank-you. Edit :: I want a most-general ...
29 views

127 views

### Can an odd perfect number be divisible by 101?

Preamble - This question is an offshoot from the following earlier questions here at MSE: Can an odd perfect number be divisible by 825? Can an odd perfect number be divisible by 165? Odd perfect ...
164 views

### Does the following inequality hold if and only if $N$ is an odd deficient number?

Let $N \in \mathbb{N}$. (That is, let $N$ be a positive integer.) This is in reference to two of my earlier questions here at MSE: Does the following inequality hold true, in general? Does this ...
180 views

### A question about odd perfect numbers

Edit [in response to a comment from anon]: Hereinafter, $N$ is a positive integer, $\sigma(N)$ is the sum-of-divisors of $N$, $\omega(N)$ is the number of distinct prime factors of $N$, and ...
154 views

### Does this inequality hold true, in general?

Let $$N = \prod_{i=1}^{\omega(N)}{{p_i}^{\alpha_i}}$$ be the prime factorization of the positive integer $N$. Does the following inequality hold true in general? ...
150 views

### Floor Inequalities

Proving the integrality of an fractions of factorials can be done through De Polignac formula for the exponent of factorials, reducing the question to an floored inequality. Some of those inequalities ...
283 views

### Greatest integer $n$ where $n \lt (\sqrt5 +\sqrt7)^6$

I'm really not sure how to do this. I factored out a power of $3$ and squared so that I have $2^3 (6+\sqrt{35})^3 \gt n$ , and I know that if I can prove that $12^3-1 \le (6+\sqrt{35})^3 \lt 12^3$ I ...
92 views

### Proving the existence of integer solutions to linear inequalities

Let $b_k\in\mathbb{Z}^n$ for $1\le k\le m$ for some $m,n$. I wish to prove the existence of two vectors $x,y\in\mathbb{Z}^n$ such that for all $k$, $b_k\cdot x\ne 0$ and $b_k\cdot y\ne 0$ with ...