Skip to main content

All Questions

2 votes
0 answers
65 views

Conjecture on Infinitely Many Consecutive Pairs of Early Primes

An early prime is one which is less than the arithmetic mean of the prime before and the prime after. Conjecture: There are infinitely many consecutive pairs of early primes MY attempt Well, the fact ...
Saucitom's user avatar
4 votes
1 answer
135 views

2-adic valuations of $k\cdot 3^n-1$

I was just playing around with numbers of the form $3^n-1$, and noticed that their 2-adic valuations have a nice, understandable pattern: $\left(v_2(3^n-1)\right)_{n\ge 1} = (1,3,1,4,1,3,1,5,1,3,1,4,1,...
G Tony Jacobs's user avatar
1 vote
0 answers
61 views

Lower bound of Hypergeometric function ${}_2F_1(d,1,d+1, z)$ [closed]

I am looking for a (non-trivial) lower bound of the Gauss hypergeometric function ${}_2F_1(d,1,d+1, z)$ where $d\in\mathbb{N}$ and $0\leq z <1$. Ideally, the bound would be valid $\forall d\in\...
JRF's user avatar
  • 11
0 votes
1 answer
35 views

Termwise Differentiation of Convergent Series Involving the Riemann Zeta Function

Let $\zeta(s)$ be the Riemann zeta function. We know that $$\zeta(s) = \prod_p(1 - p^{-s})^{-1}, \ \operatorname{Re} s > 1$$ in the sense that the righthand side converges absolutely to $\zeta(s)$ ...
Johnny Apple's user avatar
  • 4,429
1 vote
0 answers
30 views

Existence of $n$ where $S_b(n^k) \equiv r \pmod{M}$ where $S_b$ denotes sum of digits in base $b$

Let $b, k, M \in \mathbb{N} \setminus \{1\}$, $r \in \{0, 1, \dots M-1\}$ and $S_b: \mathbb{N}_0 \rightarrow \mathbb{N}_0 $ denote the method which outputs the sum of digits of its input in base $b$. ...
EnEm's user avatar
  • 1,181
0 votes
0 answers
12 views

Is the non-uniform membership problem for sets obtained from 1 by applying affine integer functions P/NP-complete/other?

The question concerns algorithmic complexity of the membership problem for sets obtained from $1$ by applying a fixed number of affine functions. One such example is Klarner-Rado sequence (A002977 in ...
lolicomu's user avatar
3 votes
1 answer
84 views

For which integers $m$ does an infinite string of characters $S = c_{1} \cdot c_{2} \cdot c_{3} \cdot c_{4} \cdot c_{5} \ldots$ exist

Question: For which integers $m$ does an infinite string of characters $$S = c_{1} \cdot c_{2} \cdot c_{3} \cdot c_{4} \cdot c_{5} \ldots$$ exist such that for all $n \in \mathbb{Z}_{>0}$ there are ...
Mods And Staff Are Not Fair's user avatar
2 votes
1 answer
104 views

Define the sum of transfinite ordinal sequences according to finite ordinal sum.

I know it is possibile to define finite sum of ordinals: if $(\alpha_i)_{i\in n}$ is a sequence of lenght $n$, with $n$ in $\omega$, then the symbolism $\sum_{i\in n}\alpha_i$ has a (formal) meaning; ...
Antonio Maria Di Mauro's user avatar
2 votes
0 answers
139 views

Divisors sum and Bessel Function related sums

Discovered the following relation: $$\sum _{k=1}^{\infty } \sigma (k) \left(K_2\left(4 \pi \sqrt{k+y} \sqrt{y}\right)-K_0\left(4 \pi \sqrt{k+y} \sqrt{y}\right)\right)=\frac{\pi K_1(4 \pi y)-3 K_0(...
Gevorg Hmayakyan's user avatar
0 votes
0 answers
75 views

$1^2+2^2+3^2+\cdots+n^2=y^2$ ($n$ and $y$ are natural numbers) [duplicate]

I tried solving this so first $1^2+2^2+\cdots+n^2=n(n+1)(2n+1)/6$ so problem is $n(n+1)(2n+1)=6y^2$ where $n$ and $y$ are natural. I tried doing this $n=6k,6k+1....6k+5$, so say for $n=6k$ you get $k(...
Sarkis 100's user avatar
3 votes
0 answers
87 views

Formula including divisors sum ($\sigma$), Euler Gamma ($\gamma$), $\pi$ and $\ln \pi$ [closed]

An interesting formula arose during the investigation of divisors sum efficient calculation. Actually the below series converges very slowly, as every series containing $\gamma$ :) $$\sum _{k=1}^{\...
Gevorg Hmayakyan's user avatar
6 votes
1 answer
95 views

How do I check if this number is transcendental?

Two days ago, I tried to create an infinite series that might be able to generate a transcendental number, and when I checked the proper definition, it was mentioned that, it is a number that cannot ...
Teflon's user avatar
  • 73
2 votes
1 answer
77 views

Let $x_0 = 3;\ x_{n+1}=3x_n\ $ if $\ \frac{x_n}{2}<1;\ x_{n+1}=\frac{x_n}{2}\ $ if $\ \frac{x_n}{2}>1.\ $ Is $\ \liminf_{n\to\infty} x_n=1?$

This is a natural follow-up question of this previous question of mine. Let $x_0 = 3.$ Let $\ x_{n+1} = 3x_n\ $ if $\ \frac{x_n}{2}<1;\quad x_{n+1} = \frac{x_n}{2}\ $ if $\ \frac{x_n}{2}>1.\quad ...
Adam Rubinson's user avatar
1 vote
0 answers
31 views

Looking for a solution to a 2-dimensional recurrence relation with a floor function in GF(2)

I have a recurrence relation that i'd like to solve. It is defined as follows: $$ a_{i,j} = (a_{i-1,j} + \lfloor 3 \sum_{k=0}^{j-1} \frac{a_{i-1,k}}{2^{j-k}} \rfloor \space) \bmod 2 $$ where $ a_{i,...
BlueLisztmaths's user avatar
2 votes
0 answers
75 views

Except for $1$, are there any perfect powers in the sequence $1,122,122333,\cdots,122333\cdots\underbrace{nnn\cdots n}_{n \text{ times}}$?

Other than $1$, is there any perfect powers in the sequence $1,122,122333,\cdots,122333\cdots\underbrace{nnn\cdots n}_{n \text{ times}}$? This is sequence A098129. We certainly know that this is not a ...
Thirdy Yabata's user avatar

15 30 50 per page
1
2 3 4 5
104