scientific article; zbMATH DE number 1990674

MaRDI QIDQ4430835zbMATH OpenFDO

Authors John A. Bate, G. H. J. van Rees, P. C. Li

Publication date 13 October 2003

zbMATH Keywords

covering design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Recommendations

• The diophantine equation x^ 2+119 = 15 2^ n has exactly six solutions
• \(R(C_6,K_5)=21\) and \(R(C_7,K_5)=25\)
• The equations \((x+1) \cdots (x+k) = (y+1) \cdots (y+m),\quad m=5,6\)
• On the Diophantine equation \(x (x+1) (x+2) (x+3)=19y (y+1) (y+2) (y+3)\)
• scientific article; zbMATH DE number 1134638
• The diophantine equation x² + 19 = yⁿ
• The Diophantine equation x^2+3a\cdot 5b\cdot 7c\cdot 19d=4y^n
• Expressing (a^ 2+b^ 2+c^ 2+d^ 2)^ 3 as a sum of 23 sixth powers
• The equation (w+x+y+z)(1/w+1/x+1/y+1/z) = n
• On the equations a²−2b⁶=c^p and a²−2=c^p

Cited in

(5)

• Small covering designs by branch-and-cut
• Generalized covering designs and clique coverings
• Covering designs on 13 blocks revisisted
• scientific article; zbMATH DE number 4008406 (Why is no real title available?)
• scientific article; zbMATH DE number 812043 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4430835)