In this work, we construct complete (k,n)-arcs and we find some of them are maximum for some n, 2 < n < 8. if n = 2, where every arc which constructed by the equation of the conic called conic arc, and from it we constructs complete arcs and we prove it’s maximum by taking the union of two ,three and six conics , respectively. and then we show By adding the points of index zero for the (k6,6)-arc, (k7,7)-arc, respectively, we get a maximum complete (k8,8)-arc.Â
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.