English
Related papers

Related papers: When is sinx+cosx+tanx+cotx+secx+cscx an integer ?

200 papers

We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…

General Mathematics · Mathematics 2008-03-28 Konstantine "Hermes" Zelator

We consider $N$, the number of solutions $(x,y,u,v)$ to the equation $ (-1)^u r a^x + (-1)^v s b^y = c $ in nonnegative integers $x, y$ and integers $u, v \in \{0,1\}$, for given integers $a>1$, $b>1$, $c>0$, $r>0$ and $s>0$. Previous work…

Number Theory · Mathematics 2011-12-21 Reese Scott , Robert Styer

Let $r$ be a sufficiently large positive integer, and let $N \ge \exp\exp(r^{50})$. Then any $r$-colouring of $[N]$ contains a monochromatic copy of $\{x+y,xy\}$ with $x > y > 2$.

Number Theory · Mathematics 2025-11-20 Ben Green , Mehtaab Sawhney

The 3x+1 problem is one of the most classical problems in computer science, related to many fields. As it is thought by scientists a highly hard problem, resolving it successfully not only can improve the research in many relating fields,…

Discrete Mathematics · Computer Science 2012-05-07 Lizhi Du

We consider a translation invariant linear equation in four variables with integer coefficients of the form: $ax_1 +bx_2= cy_1+dy_2$. The main result of the paper states that any set on the real line with Fourier dimension greater than 1/2…

Classical Analysis and ODEs · Mathematics 2024-11-12 Angel D. Cruz

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

Optimization and Control · Mathematics 2017-06-20 Miles Lubin , Ilias Zadik , Juan Pablo Vielma

The relative equilibria of planar Newtonian $N$-body problem become coorbital around a central mass in the limit when all but one of the masses becomes zero. We prove a variety of results about the coorbital relative equilibria, with an…

Dynamical Systems · Mathematics 2022-03-17 Yiyang Deng , Marshall Hampton , Zhiqiang Wang

This paper considers solutions (x_1, x_2, ..., x_n) to the cyclic system of n simultaneous congruences r (x_1x_2 ...x_n)/x_i = s (mod |x_i|), for fixed nonzero integers r,s with r>0 and gcd(r,s)=1. It shows this system has a finite number…

Number Theory · Mathematics 2010-12-09 Jeffrey C. Lagarias

The secant method is a very effective numerical procedure used for solving nonlinear equations of the form $f(x)=0$. It is derived via a linear interpolation procedure and employs only values of $f(x)$ at the approximations to the root of…

Numerical Analysis · Mathematics 2020-12-09 Avram Sidi

Quadratic functions have applications in cryptography. In this paper, we investigate the modular quadratic equation $$ ax^2+bx+c=0 \quad (mod \,\, 2^n), $$ and provide a complete analysis of it. More precisely, we determine when this…

Number Theory · Mathematics 2017-11-13 S. M. Dehnavi , M. R. Mirzaee Shamsabad , A. Mahmoodi Rishakani

In a recent work, the present author developed an efficient method to find the number of solutions of $ax+by+cz=n$ in non-negative integer triples $(x,y,z)$ where $a,b,c$ and $n$ are given natural numbers. In this note, we use that formula…

Number Theory · Mathematics 2021-06-28 Damanvir Singh Binner

Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…

Statistics Theory · Mathematics 2008-04-14 Akimichi Takemura , Ruriko Yoshida

Let $k \geq 1$ be an integer. A set $A \subset \mathbb{Z}$ is a $k$-fold Sidon set if $A$ has only trivial solutions to each equation of the form $c_1 x_1 + c_2 x_2 + c_3 x_3 + c_4 x_4 = 0$ where $0 \leq |c_i | \leq k$, and $c_1 + c_2 + c_3…

Combinatorics · Mathematics 2013-12-18 Javier Cilleruelo , Craig Timmons

A problem in zero-sum theory is to determine all pairs $(k,n)$ for which every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While all other cases have been solved more than a decade ago, the case when $k$ equals $4$ and…

Combinatorics · Mathematics 2020-11-20 Fan Ge

We prove that every subset of $\{1,\dots, N\}$ which does not contain any solutions to the equation $x+y+z=3w$ has at most $\exp(-c(\log N)^{1/5+o(1)})N$ elements, for some $c>0$. This theorem improves upon previous estimates. Additionally,…

Combinatorics · Mathematics 2023-10-17 Tomasz Schoen

It is well known that value at a non-zero algebraic number of each of the functions $e^{x}, \ln x, \sin x, \cos x, \tan x, \csc x, \sec x, \cot x, \sinh x,$ $ \cosh x,$ $ \tanh x,$ and $\coth x$ is transcendental number (see Theorem 9.11 of…

Number Theory · Mathematics 2021-09-21 R. M. Chaphalkar , S. G. Hwang , C. H. Lee , Ki-Bong Nam

For a nonnegative integer $t$, let $c_t$ be the asymptotic density of natural numbers $n$ for which $s(n + t) \geq s(n)$, where $s(n)$ denotes the sum of digits of $n$ in base $2$. We prove that $c_t > 1/2$ for $t$ in a set of asymptotic…

Combinatorics · Mathematics 2016-05-03 Michael Drmota , Manuel Kauers , Lukas Spiegelhofer

If $$ \Delta(x) := \sum_{n\le x}c_n - Cx $$ denotes the error term in the classical Rankin-Selberg problem, then it is proved that $$ \int_0^X \Delta^4(x)\d x \ll_\epsilon X^{3+\epsilon},\quad \int_0^X \Delta_1^4(x)\d x \ll_\epsilon…

Number Theory · Mathematics 2008-11-06 Aleksandar Ivić

For any odd positive integer $x$, define $(x_n)_{n\geqslant 0} $ and $(a_n )_{n\geqslant 1} $ by setting $x_{0}=x, \,\, x_n =\cfrac{3x_{n-1} +1}{2^{a_n }}$ such that all $x_n $ are odd. The 3x+1 problem asserts that there is an $x_n =1$ for…

Number Theory · Mathematics 2019-10-15 SanMin Wang

Suppose that each number $1,2,...,N$ has one of n colours assigned. We show that if there are no monochromatic solutions to the equation $x_1+x_2+x_3=y_1+y_2$, then $N=O((n!)^{1/2})$, improving upon a result of Cwalina and Schoen. Further,…

Combinatorics · Mathematics 2025-07-30 Tomasz Kosciuszko