All Questions
5 questions with no upvoted or accepted answers
5
votes
0
answers
317
views
Elliptic curve sequences needed for universal forgery
Elliptic Curve Digital Signature Algorithm (ECDSA) admits universal forgery (UF) if the Attacker can solve the equation
$$z=\frac{f_{k-1}(x,y)f_{k+1}(x,y)}{f_{k}(x,y)^2},$$
where $k$ is unknown, $f_{k}...
2
votes
0
answers
154
views
Equi-distribution of the parity of partitions
The integer partition function $p(n)$ has a generating function given by
$$\frac1{(q)_{\infty}}=\sum_{n=0}^{\infty}p(n)q^n$$
with $(q)_{\infty}=\prod_{m=1}^{\infty}(1-q^m)$. The long-standing problem ...
1
vote
0
answers
37
views
Raggedness measure of a sequence
This surely has been done, maybe I googled the wrong adjective...
Define a raggedness measure $r$ of a sequence $S$ in this way:
Two members $S_i,S_j$ of the sequence (who don't have to be adjacent!) ...
1
vote
0
answers
108
views
Question related to sequence of recurrence relation $a_k=\operatorname{rad}(a_{k-1}+a_{k-2})$ for $k\ge 2$ where $a_0=0,a_1=1$
Define radical of an integer Wiki
$$\displaystyle{\mathrm{rad}}(n)=\prod_{{\scriptstyle p\mid n\atop p\:{\text{prime}}}}p$$
Example $n=504=2^3\cdot3^2\cdot7$ therefore ${\displaystyle \operatorname{...
0
votes
0
answers
86
views
Polynomials of integer coefficients that evaluated at Mersenne or Fermat numbers produce square-free integers
Mersenne numbers $M_n=2^n-1$ and Fermat numbers $F_n=2^{2^n}+1$ draw the attention of professional mathematicians to get prime constellations or statements related to primality tests for these ...