• Aucun résultat trouvé

HOMEWORK I THEORY OF NUMBERS

N/A
N/A
Protected

Academic year: 2022

Partager "HOMEWORK I THEORY OF NUMBERS"

Copied!
1
0
0

Texte intégral

(1)

HOMEWORK I THEORY OF NUMBERS due on September, 14, 2017, by 3.30pm submit by email to pirutka@cims.nyu.edu

1. It is generally believed that infinitely many primes have the form N2 + 1, although no one knows for sure. Do you think there are infinitely many primes of the form N2−1?

2. Find a formula for all points on the hyperbola x2−y2 = 1 whose coordinates are rational numbers. (Hint. Take the line through the point (−1,0) having rational slope k and find a formula in terms of k for the second point where the line intersects the hyperbola.)

3. Prove or disprove: if a |(b+c), then eithera |b ora|c.

4. Determine the remainder of the division of (a) 2021 by 14;

(b) 2021n+ 1 by 43, where n is a positive integer.

1

Références

Documents relatifs

This algorithm generalizes the Gaudry–G¨ urel algorithm [ GG01 ] from superel- liptic curves to general cyclic covers, following the approach of Harrison [ Har12 ] for

All these materials existed before: the turbulent carbon filaments, the academic gra- phene, the speculative carbon balloon.. But by the 1990s their mode of exis- tence shifted

This is the weakest version of syntomic cohomology and all other versions, in particular H syn has natural maps to it [2, Proposition 9.5], which, by definition, are compatible

A Partial Wave Analysis (PWA) of the centrally produced K + K − system has been per- formed assuming the K + K − system is produced by the collision of two particles (referred to

For l /a 5 100 and infinite distance d between the two defects we expect the configuration with lower energy to consist of a twofold symmetric vacancy V2 and a centered interstitial

From examples, it is shown that determinantal (fermion) point processes can be super-homogeneous (the number variance grows slower than the number mean) and even hyper-uniform

To the best of our knowl- edge, OLU W is the first on-line algorithm maximizing the size with guarantees on the competitive ratio for the time- constrained scheduling problem on

Compute the margin of error and the fluctuation interval at 95% confidence for the probability p and a sample of 50 throws.. She still isn’t convinced and throws the die