Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
for question related to conjectures.
3
votes
1
answer
566
views
Prove this conjecture inequality
This following problem is from my Conjecture many years ago,
Question :
Let $a,b>0,n\in N^{+},n\ge 3$,such
$$a^n+b^n+(2n+2)(ab)^n\le 2n$$
Conjecture: then $a+b\le 2$
or
$a+b>2.a>0.b>0,n\ge 3$,the …
4
votes
0
answers
315
views
there exist infinite many $n\in\mathbb{N}$ such that $S_n-[S_n]<\frac{1}{n^2}$
Let $S_n:=1+\frac12+\frac13+\ldots+\frac1n$. Is it true that the set of $n\in\mathbb N$ such that
$$S_n-[S_n]<\dfrac{1}{n^2}$$
is infinite?
Here, $[x]$ represents the largest integer not exceeding $x$ …
3
votes
1
answer
820
views
Find all positive integers $n$ such that $n+\tau{(n)}=2\varphi{(n)}$
Conjecture:Today I have no intention of thinking about this question. I have only got two solutions so far. I guess there are only two solutions, but I won't prove it.
Let $n$ be positive integers, s …
3
votes
1
answer
354
views
Solve this diophantine equation: $m^4+n^4=10m^2n^2+1$
t's probably common knowledge that there are Diophantine equations which do not admit any solutions in the integers, but which admit solutions modulo nn for every nn. This fact is stated, for example, …